The Voronoi functional is maximized by the Delaunay triangulation in the plane
From MaRDI portal
(Redirected from Publication:722309)
Abstract: We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result neither extends to topological triangulations in the plane nor to geometric triangulations in three and higher dimensions.
Recommendations
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- MAXIMIZING A VORONOI REGION: THE CONVEX CASE
- scientific article; zbMATH DE number 1979535
- On the optimality of functionals over triangulations of Delaunay sets
- scientific article; zbMATH DE number 2066953
- The farthest point Delaunay triangulation minimizes angles
- An optimal algorithm for realizing a Delaunay triangulation
- Combinatorial Geometry and Graph Theory
- Functionals on triangulations of Delaunay sets
- scientific article; zbMATH DE number 176773
Cites work
Cited in
(2)
This page was built for publication: The Voronoi functional is maximized by the Delaunay triangulation in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722309)