Delaunay triangulation

Noun

Meaning

Delaunay triangulation (countable and uncountable, plural Delaunay triangulations)

(geometry, computer graphics) For a given set P of discrete points in a plane: a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P).

Examples

Applications 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. Source: Internet

Halfway through, the triangulating edge flips showing that the Delaunay triangulation maximizes the minimum angle, not the edge-length of the triangles. Source: Internet

By considering circumscribed spheres, the notion of Delaunay triangulation extends to three and higher dimensions. Source: Internet

Flipping the common edge produces a Delaunay triangulation for the four points. Source: Internet

However, the Delaunay triangulation does not necessarily minimize the maximum angle. citation. Source: Internet

In particular, the Delaunay triangulation avoids narrow triangles (as they have large circumcircles compared to their area). Source: Internet

Close letter words and terms