Faster normalXAngle --> faster sin,cos,tan

Jump to navigation Jump to search

Have a look at Polynomial Approximations to Sine and Cosine. This uses no memory and is even faster than the lookup table approach. Skilgannon uses this as far as I know.

Also have a look at Chebyshev Approximation (http://metamerist.com/cheby/example38.htm archive) which works pretty well for atan, asin and acos.

Xor (talk)‎05:17, 15 August 2018

That is what I'm referring to as the "polynomial implementation" above. My intuition is that the LUT version is only slower in practice because it gets evicted out of the cache due to being so large. I haven't done a side-by-side comparison test yet, but I've shrunk it by roughly a factor of 32 from the smallest version I've seen on this page, and I've added a couple other tricks to reduce the calculations required to find the lookup index. Once I truly need the speed boost I'll begin benchmarking the two against each other.

Enamel 32 (talk)‎17:39, 15 August 2018
 
Retrieved from "http://robowiki.net/wiki/Thread:User_talk:Rednaxela/FastTrig/Faster_normalXAngle_--_faster_sin,cos,tan/reply_(10)#Faster_normalXAngle_--.3E_faster_sin.2Ccos.2Ctan_6351"