The Voronoi diagram is just the dual graph of the Delaunay triangulation. So, the edges of the Voronoi diagram are along the perpendicular bisectors of the edges of the Delaunay triangulation, so compute those lines. Then, compute the vertices of the Voronoi diagram by finding the intersections of adjacent edges. Finally, the edges are then … Read more
If you want to construct the 2D Delaunay triangulation, use Triangle.Net. It is a direct C# port of Shewchuk’s famous Triangle program.
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