Lookup tables are justified when the: cost of OP > cost of lookup+storage
A lookup table for plain x*y multiply is likely to be useless(with exception of innermost loops), but lookup for x*y*z-v*y*x would reduce computational load significantly.
Division is usually replaced by muls to inverse, and inverse tables/consts can be created for common vars,much more useful in practice.
I dislike lookup tables personally, it is inelegant solution to algorithmic load,unlike simplifying higher level formula describing the algorithm.
Nevertheless, expert usage and testing can make lookup tables effective, especially when the table is generated dynamically in response to data(as in Acid code) simplifying the code into a chain of lookup tables.
>>63
I can hardcode most of the stuff, but this will cost with flexibility:
no zoom factor changes for example, no custom sin/cos table seeds,etc.