Voronoi Diagrams and Delaunay Triangulations Franz Aurenhammer, Rolf Klein, Der-Tsai Lee
Publisher: World Scientific Publishing Company, Incorporated

It runs in 2-d, 3-d, 4-d, and higher dimensions. Feb 1, 2001 - Qhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. Dec 27, 2012 - Any point (nodal-point of the grid) lies outside the circumcentre and hence any vertex of the Voronoi diagram has degree 3 and the DT will be a triangulation. Jul 30, 2012 - If you are a mathy type, you'll recall that the dual graph of a Voronoi diagram for a set of reference points is the Delaunay triangulation of that set of points. Mar 12, 2014 - The O(n log n) sweepline Delaunay triangulation algorithm is taken from */ /* Steven Fortune, "A Sweepline Algorithm for Voronoi Diagrams", */ /* Algorithmica 2(2):153-174, 1987. The brown lines are orthogonal to this, and form the Voronoi diagram. May 29, 2004 - Good applet for demo of Voronoi Diagram and Delaunay Triangulation VD and DT are the most useful geometric structures. Feb 10, 2012 - The black lines are the Delaunay Triangulation. Jan 4, 2010 - What we need is described by a well-understood concept, a “weighted Delaunay triangulation“. Mar 29, 2014 - Voronoi diagram and its geometric dual, the Delaunay triangulation, both are practical geometric constructions which have been applied extensively in spatial analysis.