A triangulation of a point set in the plane (or higher dimension) such that no point lies inside the circumcircle of any triangle (empty circumcircle property); it tends to maximize the minimum angle among triangles and is widely used in meshing and interpolation.

Principle

The Delaunay criterion enforces local empty-circumcircle conditions which, when satisfied globally, produce a triangulation with favorable shape qualities; the Delaunay complex is dual to the Voronoi diagram of the same seeds.

Demonstration

Given a finite planar point set, construct the planar graph where triangles satisfy that their circumcircles contain no other input points; for example, performing edge flips on an arbitrary triangulation until all opposite angles satisfy the Delaunay inequality yields the Delaunay triangulation.

Misapplication

Using Delaunay triangulation for poorly conditioned point sets without handling cocircular or nearly cocircular points (e.g., ignoring numerical precision) can create ambiguous faces, flipped elements in meshes, or artifacts in interpolation.

Consequence

Correct Delaunay triangulation produces meshes with bounded minimal angles, good aspect ratios, and guarantees that circumcenters lie in well-defined Voronoi cells, which benefits finite-element methods and nearest-neighbor queries.

Reversal

The dual structure, the Voronoi diagram, reverses perspective by assigning regions to seeds rather than composing triangles from points; reversing highlights proximity-based partitioning instead of simplicial connectivity.

Boundary

Defined for discrete point sets in Euclidean spaces with generalization to higher dimensions as a Delaunay complex; excludes weighted variants (regular triangulations), constrained edges, and non-Euclidean metrics unless adapted.

Semantic Tension

Delaunay triangulation competes with constrained triangulations and mesh-optimization techniques: Delaunay optimizes angle criteria globally under empty-circumcircle rules, while constrained methods prioritize boundary fidelity or metric-specific quality over pure Delaunay optimality.

Synthesis

Delaunay triangulation is the simplicial complex dual to the Voronoi partition that enforces empty circumcircle conditions; it yields triangulations with provably good local shape properties useful for meshing, interpolation, and geometric computation.