The farthest point Delaunay triangulation minimizes angles

DOI10.1016/0925-7721(92)90013-IzbMath0762.52005OpenAlexW4240145741MaRDI QIDQ1188284

David Eppstein

Publication date: 13 August 1992

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(92)90013-i

zbMATH Keywords

convex hullcomputational geometryDelaunay triangulationfarthest point Voronoi diagrams

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

A geometric characterisation of the quadratic min-power centre ⋮ Meissner polyhedra ⋮ Data structures for halfplane proximity queries and incremental Voronoi diagrams ⋮ Polynomial-time instances of the minimum weight triangulation problem ⋮ Approximating the minimum weight Steiner triangulation

Cites Work

• Unnamed Item
• Voronoi diagrams from convex hulls
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Partitioning Space for Range Queries
• Minimal Triangulations of Polygonal Domains
• Fast algorithms for greedy triangulation

This page was built for publication: The farthest point Delaunay triangulation minimizes angles