Re: fast pow() for limited inputs
"Simon Fenney" <[email protected]> Thu, 19 Aug 2010 16:45:00 +0100
| Newsgroups | gmane.games.devel.algorithms |
|---|---|
| Message-ID | <[email protected]> |
Jeff, I don't know how much accuracy you are really after, but Jim Blinn had a little article called "Floating-Point Tricks" that was in IEEE CG&A Jul/Aug 1997, which has some "log2" and "exp2" approximations. It's also printed in his "Notation, Notation, Notation" book. Cheers Simon ________________________________ From: Jeff Russell [mailto:[email protected]] Sent: 19 August 2010 16:32 To: Game Development Algorithms Subject: Re: [Algorithms] fast pow() for limited inputs Thanks Fabian, good info there. I'll check out minimax polynomials, and as both you and Simon pointed out base 2 log/exp would probably make more sense. Jeff ------------------------------------------------------------------------------ This SF.net email is sponsored by Make an app they can't live without Enter the BlackBerry Developer Challenge http://p.sf.net/sfu/RIM-dev2dev _______________________________________________ GDAlgorithms-list mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list Archives: http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list