delaunay triangulation

classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view
|

delaunay triangulation

jerk
hi all,
Basically i'm interested in surface creation based on set of points(like
terrain). As i understood, best way to do this is delaunay
triangulation. However, delaunay is quite slow (N^2 operations)if divide
and conquer or similar algorithm is applied. Does anyone know if
delaunay object has some kind of divide and conquer alogorithm(or
similar) to speed up the triangulation (for example huge mesh) up to
extent of or close to Nlog(N) operations vs. N^2 operations number of
ordinary delaunay triangulation? Did anyone worked on this issue? I'm
interested in developing this kind of algorithm (like in triangle -
http://www.cs.cmu.edu/~quake/triangle.html), but it would be real shame
to duplicate the effort if someone else did similar thing.
cheers,
jerk

_______________________________________________
This is the private VTK discussion list.
Please keep messages on-topic. Check the FAQ at: http://www.vtk.org/Wiki/VTK_FAQ
Follow this link to subscribe/unsubscribe:
http://www.vtk.org/mailman/listinfo/vtkusers