Re: triangulation algorithm for when neighborhood is already known

Diego Nehab has a nice paper titled "Efficiently Combining Positions
and Normals for Precise 3D Geometry", with source code available on
his website http://www.tecgraf.puc-rio.br/~diego/academic/publications/

Admittedly this is cheating, since you haven't really measured the
normals (just estimated them from the noisy point cloud), but you
could run it and see if you like the results.

-Michael Holroyd



On Nov 11, 1:25 pm, omle...@xxxxxxxxx wrote:
Let's say I have a set of 3D points and someone else has already
determined the nearest neighbor graph. Can anyone think of a
algorithm to triangulate the points? It doesn't have to be
watertight...

I was thinking of brute forcing it by saying that each point can form
a triangle w/ 2 neighbors, but I'm hoping there's a better way...

Thanks in advance

--
Peace,
Amit


.