Looks like what is described here http://en.wikipedia.org/wiki/Delaunay_triangulation : The problem of finding the Delaunay triangulation of a set of points in d-dimensional Euclidean space can be converted to the problem of finding the convex hull of a set of points in (d + 1)-dimensional space, by giving each point p an extra coordinate equal to … Read more
here are some other good links for mesh generation and its related work. • TetGen : A Quality Tetrahedral Mesh Generator http://wias-berlin.de/software/tetgen/ • CGal-Computational Geometry Algorithms Library http://www.cgal.org/. http://www.cgal.org/Manual/latest/doc_html/cgal_manual/packages.html#Pkg:Triangulation3. http://www.cgal.org/Manual/latest/doc_html/cgal_manual/contents.html#part_VI. http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Surface_reconstruction_points_3/Chapter_main.html. 3D Surface Mesh Generation – http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Surface_mesher/Chapter_main.html • GTSLibrary – The GNU Triangulated Surface Library. http://gts.sourceforge.net/index.html • Jonathan Shewchuk – http://www.cs.berkeley.edu/~jrs/ http://www.cs.cmu.edu/~quake/robust.html • VTK: The … Read more