In mathematics and computational geometry, a Delaunay triangulation (also known as a Delone triangulation) for a given set P of discrete points in a plane is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P). Delaunay triangulations maximize the minimum angle of all the angles of the triangles in the triangulation; they tend to avoid sliver triangles. The triangulation is named after Boris Delaunay for his work on this topic from 1934.
For a set of points on the same line there is no Delaunay triangulation (the notion of triangulation is degenerate for this case). For four or more points on the same circle (e.g., the vertices of a rectangle) the Delaunay triangulation is not unique: each of the two possible triangulations that split the quadrangle into two triangles satisfies the "Delaunay condition", i.e., the requirement that the circumcircles of all triangles have empty interiors.
By considering circumscribed spheres, the notion of Delaunay triangulation extends to three and higher dimensions. Generalizations are possible to metrics other than Euclidean distance. However, in these cases a Delaunay triangulation is not guaranteed to exist or be unique.
Relationship with the Voronoi diagram
The Delaunay triangulation of a discrete point set P in general position corresponds to the dual graph of the Voronoi diagram for P. Special cases include the existence of three points on a line and four points on circle.
Connecting the centers of the circumcircles produces the Voronoi diagram (in red).
For a set P of points in the (d-dimensional) Euclidean space, a Delaunay triangulation is a triangulation DT(P) such that no point in P is inside the circum-hypersphere of any d-simplex in DT(P). It is known that there exists a unique Delaunay triangulation for P if P is a set of points in general position; that is, the affine hull of P is d-dimensional and no set of d + 2 points in P lie on the boundary of a ball whose interior does not intersect P.
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 |p|2, taking the bottom side of the convex hull, and mapping back to d-dimensional space by deleting the last coordinate. As the convex hull is unique, so is the triangulation, assuming all facets of the convex hull are simplices. Nonsimplicial facets only occur when d + 2 of the original points lie on the same d-hypersphere, i.e., the points are not in general position.
Let n be the number of points and d the number of dimensions.
- The union of all simplices in the triangulation is the convex hull of the points.
- The Delaunay triangulation contains O(n⌈d / 2⌉) simplices.
- In the plane (d = 2), if there are b vertices on the convex hull, then any triangulation of the points has at most 2n − 2 − b triangles, plus one exterior face (see Euler characteristic).
- If points are distributed according to a Poisson process in the plane with constant intensity, then each vertex has on average six surrounding triangles. More generally for the same process in d dimensions the average number of neighbors is a constant depending only on d.
- In the plane, the Delaunay triangulation maximizes the minimum angle. Compared to any other triangulation of the points, the smallest angle in the Delaunay triangulation is at least as large as the smallest angle in any other. However, the Delaunay triangulation does not necessarily minimize the maximum angle. The Delaunay triangulation also does not necessarily minimize the length of the edges.
- A circle circumscribing any Delaunay triangle does not contain any other input points in its interior.
- If a circle passing through two of the input points doesn't contain any other of them in its interior, then the segment connecting the two points is an edge of a Delaunay triangulation of the given points.
- Each triangle of the Delaunay triangulation of a set of points in d-dimensional spaces corresponds to a facet of convex hull of the projection of the points onto a (d + 1)-dimensional paraboloid, and vice versa.
- The closest neighbor b to any point p is on an edge bp in the Delaunay triangulation since the nearest neighbor graph is a subgraph of the Delaunay triangulation.
- The Delaunay triangulation is a geometric spanner: In the plane (d = 2), the shortest path between two vertices, along Delaunay edges, is known to be no longer than times the Euclidean distance between them.
Visual Delaunay definition: Flipping
From the above properties an important feature arises: Looking at two triangles ABD and BCD with the common edge BD (see figures), if the sum of the angles α and γ is less than or equal to 180°, the triangles meet the Delaunay condition.
This is an important property because it allows the use of a flipping technique. If two triangles do not meet the Delaunay condition, switching the common edge BD for the common edge AC produces two triangles that do meet the Delaunay condition:
This operation is called a flip, and can be generalised to three and higher dimensions.
Many algorithms for computing Delaunay triangulations rely on fast operations for detecting when a point is within a triangle's circumcircle and an efficient data structure for storing triangles and edges. In two dimensions, one way to detect if point D lies in the circumcircle of A, B, C is to evaluate the determinant:
When A, B and C are sorted in a counterclockwise order, this determinant is positive if and only if D lies inside the circumcircle.
As mentioned above, if a triangle is non-Delaunay, we can flip one of its edges. This leads to a straightforward algorithm: construct any triangulation of the points, and then flip edges until no triangle is non-Delaunay. Unfortunately, this can take Ω(n2) edge flips. While this algorithm can be generalised to three and higher dimensions, its convergence is not guaranteed in these cases, as it is conditioned to the connectedness of the underlying flip graph: this graph is connected for two dimensional sets of points, but may be disconnected in higher dimensions.
The most straightforward way of efficiently computing the Delaunay triangulation is to repeatedly add one vertex at a time, retriangulating the affected parts of the graph. When a vertex v is added, we split in three the triangle that contains v, then we apply the flip algorithm. Done naïvely, this will take O(n) time: we search through all the triangles to find the one that contains v, then we potentially flip away every triangle. Then the overall runtime is O(n2).
If we insert vertices in random order, it turns out (by a somewhat intricate proof) that each insertion will flip, on average, only O(1) triangles – although sometimes it will flip many more. This still leaves the point location time to improve. We can store the history of the splits and flips performed: each triangle stores a pointer to the two or three triangles that replaced it. To find the triangle that contains v, we start at a root triangle, and follow the pointer that points to a triangle that contains v, until we find a triangle that has not yet been replaced. On average, this will also take O(log n) time. Over all vertices, then, this takes O(n log n) time. While the technique extends to higher dimension (as proved by Edelsbrunner and Shah), the runtime can be exponential in the dimension even if the final Delaunay triangulation is small.
The Bowyer–Watson algorithm provides another approach for incremental construction. It gives an alternative to edge flipping for computing the Delaunay triangles containing a newly inserted vertex.
Unfortunately the flipping-based algorithms are generally hard to be parallelized, since adding some certain point (e.g. the center point of a wagon wheel) can lead to up to O(n) consecutive flips. Blelloch et al. proposed another version of incremental algorithm based on rip-and-tent, which is practical and highly parallelized with polylogarithmic span.
Divide and conquer
A divide and conquer algorithm for triangulations in two dimensions was developed by Lee and Schachter and improved by Guibas and Stolfi and later by Dwyer. In this algorithm, one recursively draws a line to split the vertices into two sets. The Delaunay triangulation is computed for each set, and then the two sets are merged along the splitting line. Using some clever tricks, the merge operation can be done in time O(n), so the total running time is O(n log n).
For certain types of point sets, such as a uniform random distribution, by intelligently picking the splitting lines the expected time can be reduced to O(n log log n) while still maintaining worst-case performance.
A divide and conquer paradigm to performing a triangulation in d dimensions is presented in "DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed" by P. Cignoni, C. Montani, R. Scopigno.
Sweephull is a hybrid technique for 2D Delaunay triangulation that uses a radially propagating sweep-hull, and a flipping algorithm. The sweep-hull is created sequentially by iterating a radially-sorted set of 2D points, and connecting triangles to the visible part of the convex hull, which gives a non-overlapping triangulation. One can build a convex hull in this manner so long as the order of points guarantees no point would fall within the triangle. But, radially sorting should minimize flipping by being highly Delaunay to start. This is then paired with a final iterative triangle flipping step.
The Euclidean minimum spanning tree of a set of points is a subset of the Delaunay triangulation of the same points, and this can be exploited to compute it efficiently.
For modelling terrain or other objects given a set of sample points, the Delaunay triangulation gives a nice set of triangles to use as polygons in the model. In particular, the Delaunay triangulation avoids narrow triangles (as they have large circumcircles compared to their area). See triangulated irregular network.
Delaunay triangulations can be used to determine the density or intensity of points samplings by means of the Delaunay tessellation field estimator (DTFE).
Delaunay triangulations are often used to build meshes for space-discretised solvers such as the finite element method and the finite volume method of physics simulation, because of the angle guarantee and because fast triangulation algorithms have been developed. Typically, the domain to be meshed is specified as a coarse simplicial complex; for the mesh to be numerically stable, it must be refined, for instance by using Ruppert's algorithm.
The increasing popularity of finite element method and boundary element method techniques increases the incentive to improve automatic meshing algorithms. However, all of these algorithms can create distorted and even unusable grid elements. Fortunately, several techniques exist which can take an existing mesh and improve its quality. For example, smoothing (also referred to as mesh refinement) is one such method, which repositions nodal locations so as to minimize element distortion. The stretched grid method allows the generation of pseudo-regular meshes that meet the Delaunay criteria easily and quickly in a one-step solution.
- Beta skeleton
- Centroidal Voronoi tessellation
- Ruppert's algorithm - Delaunay refinement
- Delone set - also known as a Delaunay set
- Disordered hyperuniformity
- Fairy circle (arid grass formation)
- Gabriel graph
- Giant's Causeway
- Gradient pattern analysis
- Farthest-first traversal - Incremental Voronoi insertion
- Linde–Buzo–Gray algorithm
- Lloyd's algorithm - Voronoi iteration
- Meyer set
- Pisot–Vijayaraghavan number
- Pitteway triangulation
- Hamming bound - Sphere-packing bound
- Salem number
- Steiner point (triangle)
- Urquhart graph
- Convex hull algorithms
- Delaunay, Boris (1934). "Sur la sphère vide". Bulletin de l'Académie des Sciences de l'URSS, Classe des sciences mathématiques et naturelles. 6: 793–800.
- Seidel, Raimund (1995). "The upper bound theorem for polytopes: an easy proof of its asymptotic version". Computational Geometry. 5 (2): 115–116. doi:10.1016/0925-7721(95)00013-Y.
- Meijering, J. L. (1953), "Interface area, edge length, and number of vertices in crystal aggregates with random nucleation" (PDF), Philips Research Reports, 8: 270–290, archived (PDF) from the original on 2017-03-08. As cited by Dwyer, Rex A. (1991), "Higher-dimensional Voronoĭ diagrams in linear expected time", Discrete and Computational Geometry, 6 (4): 343–367, doi:10.1007/BF02574694, MR 1098813.
- Edelsbrunner, Herbert; Tan, Tiow Seng; Waupotitsch, Roman (1992), "An O(n2 log n) time algorithm for the minmax angle triangulation" (PDF), SIAM Journal on Scientific and Statistical Computing, 13 (4): 994–1008, doi:10.1137/0913058, MR 1166172, archived (PDF) from the original on 2017-02-09.
- Keil, J. Mark; Gutwin, Carl A. (1992), "Classes of graphs which approximate the complete Euclidean graph", Discrete and Computational Geometry, 7 (1): 13–28, doi:10.1007/BF02187821, MR 1134449.
- De Loera, Jesús A.; Rambau, Jörg; Santos, Francisco (2010). Triangulations, Structures for Algorithms and Applications. Algorithms and Computation in Mathematics. 25. Springer.
- Guibas, Leonidas; Stolfi, Jorge (1985). "Primitives for the manipulation of general subdivisions and the computation of Voronoi". ACM Transactions on Graphics. 4 (2): 74–123. doi:10.1145/282918.282923.
- Hurtado, F.; M. Noy; J. Urrutia (1999). "Flipping Edges in Triangulations". Discrete & Computational Geometry. 22 (3). pp. 333–346.
- Guibas, Leonidas J.; Knuth, Donald E.; Sharir, Micha (1992). "Randomized incremental construction of Delaunay and Voronoi diagrams". Algorithmica. 7: 381–413. doi:10.1007/BF01758770.
- de Berg, Mark; Otfried Cheong; Marc van Kreveld; Mark Overmars (2008). Computational Geometry: Algorithms and Applications (PDF). Springer-Verlag. ISBN 978-3-540-77973-5. Archived (PDF) from the original on 2009-10-28.
- Edelsbrunner, Herbert; Shah, Nimish (1996). "Incremental Topological Flipping Works for Regular Triangulations". Algorithmica. 15 (3): 223–241. doi:10.1007/BF01975867.
- Blelloch, Guy; Gu, Yan; Shun, Julian; and Sun, Yihan. Parallelism in Randomized Incremental Algorithms Archived 2018-04-25 at the Wayback Machine.. SPAA 2016. doi:10.1145/2935764.2935766.
- "COMPUTING CONSTRAINED DELAUNAY TRIANGULATIONS IN THE PLANE". www.geom.uiuc.edu. Archived from the original on 22 September 2017. Retrieved 25 April 2018.
- Leach, G. (June 1992). "Improving Worst-Case Optimal Delaunay Triangulation Algorithms.". CiteSeerX .
- Cignoni, P.; C. Montani; R. Scopigno (1998). "DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed". Computer-Aided Design. 30 (5): 333–341. doi:10.1016/S0010-4485(97)00082-1.
- A Comparison of Sequential Delaunay Triangulation Algorithms "Archived copy" (PDF). Archived (PDF) from the original on 2012-03-08. Retrieved 2010-08-18.
- "Triangulation Algorithms and Data Structures". www.cs.cmu.edu. Archived from the original on 10 October 2017. Retrieved 25 April 2018.
- "S-hull" (PDF). s-hull.org. Retrieved 25 April 2018.
- "Archived copy" (PDF). Archived (PDF) from the original on 2013-07-21. Retrieved 2016-06-19.
- Delaunay triangulation in CGAL, the Computational Geometry Algorithms Library:
- "Delaunay triangulation". Wolfram MathWorld. Retrieved April 2010.