Delaunay triangulation
Delaunay triangulation is a triangulation method named after Boris Delaunay.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 18, 2026 · revision 2549964480
- Described as
- triangulation method named after Boris Delaunay
- Other names
- Delone triangulation
- What it is
- geometric construction
- Named after
- Boris Delaunay
- Wikipedias with a page
- 26
Wikidata item Q192445 (wikidata.org/wiki/Q192445), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1386322682
In computational geometry, a Delaunay triangulation or Delone triangulation of a set of points in the plane subdivides their convex hull into triangles whose circumcircles do not contain any of the points; that is, each circumcircle has its generating points on its circumference, but all other points in the set are outside of it. This maximizes the size of the smallest angle in any of the triangles, and tends to avoid sliver triangles.
The triangulation is named after Boris Delaunay for his work on it from 1934.
If the points all lie on a straight line, the notion of triangulation becomes degenerate and there is no Delaunay triangulation. 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.
From the Wikipedia article “Delaunay triangulation” (en.wikipedia.org/wiki/Delaunay_triangulation), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
Picture: Wikimedia Commons: Delaunay Voronoi.svg · See Commons file page
