I don''t know if this has been touched on in another post (the search feature is still disabled..) but in Bosco''s tutorial #11 on Nehe, you can gain a bit of a performance boost in the initialization routine.
//Change this line:
points[x][y][2]=float(sin((((x/5.0f)*40.0f)/360.0f)*3.141592654*2.0f));
//into this:
points[x][y][2] = float(sin((x/45.0) * 6.283185308));
I can only assume this was left unoptimized since it''s a part of initialization and therefore isn''t as important as optimizing an algorithm in the main runtime loop, or maybe to emphasize the division by 360 and multiply by 2pi for the radian/phase reasons.
But even so, a good algorithm is a simplified one
And this changes it from 2 divisions and 3 multiplications into only one division and one multiplication.
Anyways you can probably ignore this post, I''m enjoying being in college math and I love finding progamming algorithms I can make a little quicker
"
aut viam inveniam aut faciam" - I will either find a way or make one.
