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.

Property Value
dbo:abstract
• 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. (en)
dbo:thumbnail
dbo:wikiPageID
• 8864 (xsd:integer)
dbo:wikiPageLength
• 27497 (xsd:integer)
dbo:wikiPageRevisionID
• 981514104 (xsd:integer)
dbp:align
• right (en)
dbp:alt
• Connecting the triangulation's circumcenters gives the Voronoi diagram. (en)
• Circumcircles in the Delaunay triangulation. (en)
dbp:caption
• Connecting the centers of the circumcircles produces the Voronoi diagram . (en)
• The Delaunay triangulation with all the circumcircles and their centers . (en)
dbp:direction
• horizontal (en)
• center (en)
dbp:height
• 200 (xsd:integer)
dbp:image
• Delaunay_Voronoi.svg (en)
• Delaunay_circumcircles_centers.svg (en)
dbp:width
• 200 (xsd:integer)
dbp:wikiPageUsesTemplate
dct:subject
rdf:type
rdfs:comment
• 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. (en)
rdfs:label
• Delaunay triangulation (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:knownFor of
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of