-
3D Delauney Algorithm
Hi
I have a 3D surface in existence which is defined by a series of points. So each point is (x,y,z). Now I need to find the 3D Delauney map of the surface such that I can then find the normals to each polygon (triangle on the surface). I know how the algorithm works, but dont want to re-invent the wheel. Does anyone have a suggestion about where to go to find an algorithm to do this.
1. I don't need to introduce vertices's - these are in existence so the surface is already there.
2. Must be three dimensional.
3. Should be easy to implement and free.
Most grateful for any help. Thanks in advance.
-
I can point you to some Ruby code that implements it.
-
That would be good, no idea about ruby, but guess I'll learn
Thanks - can you post a link here....
-
