Rob Mace (mace++at++lum.esd.sgi.com)
Sat, 5 Nov 1994 01:51:54 GMT
Being the person Jim was referring to I can assure you that pfSinCos is
faster. The table lookup routine in question had a table of 901 floats,
90 degrees at 1/10th of a degree accuracy. It has to do a lookup for both
sin and cos and for each of these it has to calculate the address to use
and the sign of the result.
pfSinCos takes takes about 61% of the time that my table driven version
takes. The reason is that where as my table driven version does less
calculations it does a lot more branching. In a real app, and not a
benchmark, my table driven version would probably be even slower because
of cache behavior.
Rob Mace
This archive was generated by hypermail 2.0b2 on Mon Aug 10 1998 - 17:50:39 PDT