CodeBase - 2/3 time 2D distance computing
Uploaded: 29th Nov 2011 13:12
Modified: 29th Nov 2011 13:56
Approximates the distance between 0,0 and x,y 30% faster than euclidean squares method because no square root calculation (approximation) is needed
Also includes the formula for 3D point distance calculation, but it doesn't work well. Deviation is around 60%.
No comments yet.