Simpler proof of a realizability theorem on Delaunay triangulations

DOI10.1016/0020-0190(94)00027-1zbMath0822.68113OpenAlexW2049846663MaRDI QIDQ1327308

Kōkichi Sugihara

Publication date: 9 October 1995

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00027-1

zbMATH Keywords

realizabilityVoronoi diagramDelaunay triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

An optimal algorithm for realizing a Delaunay triangulation ⋮ Witness (Delaunay) graphs

Cites Work

• Toughness and Delaunay triangulations
• Realizability of Delaunay triangulations
• Unnamed Item
• Unnamed Item

This page was built for publication: Simpler proof of a realizability theorem on Delaunay triangulations