The farthest point Delaunay triangulation minimizes angles
D Eppstein - Computational Geometry, 1992 - Elsevier
Computational Geometry, 1992•Elsevier
The planar dual to the Euclidean farthest point Voronoi diagram for the set of vertices of a
convex polygon has the lexicographic minimum possible sequence of triangle angles,
sorted from sharpest to least sharp. As a consequence, the sharpest angle determined by
three vertices of a convex polygon can be found in linear time.
convex polygon has the lexicographic minimum possible sequence of triangle angles,
sorted from sharpest to least sharp. As a consequence, the sharpest angle determined by
three vertices of a convex polygon can be found in linear time.
Abstract
The planar dual to the Euclidean farthest point Voronoi diagram for the set of vertices of a convex polygon has the lexicographic minimum possible sequence of triangle angles, sorted from sharpest to least sharp. As a consequence, the sharpest angle determined by three vertices of a convex polygon can be found in linear time.
Elsevier
Showing the best result for this search. See all results