Databases
StackOverflow2013
Postsdbo
POFastest implementation of sine, cosine and square root in C++ (doesn't need to be much accurate)
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POFastest implementation of sine, cosine and square root in C++ (doesn't need to be much accurate)
    primarykey
    data
    text
    <p>I am googling the question for past hour, but there are only points to Taylor Series or some sample code that is either too slow or does not compile at all. Well, most answer I've found over Google is "Google it, it's already asked", but sadly <em>it's not</em>...</p> <p>I am profiling my game on low-end Pentium 4 and found out that ~85% of execution time is wasted on calculating sinus, cosinus and square root (from standard C++ library in Visual Studio), and this seems to be heavily CPU dependent (on my I7 the same functions got only 5% of execution time, and the game is <em>waaaaaaaaaay</em> faster). I cannot optimize this three functions out, nor calculate both sine and cosine in one pass (there interdependent), but I don't need too accurate results for my simulation, so I can live with faster approximation.</p> <p>So, the question: What are the fastest way to calculate sine, cosine and square root for float in C++?</p> <p><strong>EDIT</strong> Lookup table are more painful as resulting Cache Miss is way more costly on modern CPU than Taylor Series. The CPUs are just so fast these days, and cache is not.</p> <p>I made a mistake, I though that I need to calculate several factorials for Taylor Series, and I see now they can be implemented as constants.</p> <p>So the updated question: is there any speedy optimization for square root as well?</p> <p><strong>EDIT2</strong></p> <p>I am using square root to calculate distance, not normalization - can't use fast inverse square root algorithm (as pointed in comment: <a href="http://en.wikipedia.org/wiki/Fast_inverse_square_root" rel="noreferrer">http://en.wikipedia.org/wiki/Fast_inverse_square_root</a></p> <p><strong>EDIT3</strong></p> <p>I also cannot operate on squared distances, I need exact distance for calculations</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USChris Britt
    1. USPiotrK
    plurals
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POFastest implementation of sine, cosine and square root in C++ (doesn't need to be much accurate)
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POFastest implementation of sine, cosine and square root in C++ (doesn't need to be much accurate)
      1. This table or related slice is empty.
      1. VTUpMod
    1. COIt was solved many years ago - use precomputed table to get the sine/cosine numbers.
      singulars
      1. POFastest implementation of sine, cosine and square root in C++ (doesn't need to be much accurate)
      1. USSChepurin
    2. COhttp://stackoverflow.com/questions/3688649/create-sine-lookup-table-in-c
      singulars
      1. POFastest implementation of sine, cosine and square root in C++ (doesn't need to be much accurate)
      1. USdrescherjm
    3. COFor the *inverse* square root (which is common, since it is involved in vector normalization), there is a well known formula (http://en.wikipedia.org/wiki/Fast_inverse_square_root), but honestly it is a bit outdated, and probably 1.0/sqrt(x) will enable some compiler optimization.
      singulars
      1. POFastest implementation of sine, cosine and square root in C++ (doesn't need to be much accurate)
      1. USsbabbi
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload