An optimal algorithm for realizing a Delaunay triangulation

DOI10.1016/S0020-0190(97)00071-9zbMath1337.68275OpenAlexW2037540484MaRDI QIDQ287080

Timothy Lambert

Publication date: 26 May 2016

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00071-9

zbMATH Keywords

realizabilityconvex polygonscomputational geometryDelaunay triangulation

Mathematics Subject Classification ID

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

Related Items (3)

Outerplanar Graphs and Delaunay Triangulations ⋮ Star-Unfolding Polygons ⋮ Witness (Delaunay) graphs

Uses Software

• GeoBench

Cites Work

• Unnamed Item
• Unnamed Item
• On the modality of convex polygons
• Realizability of Delaunay triangulations
• Generation of convex polygons with individual angular constraints
• On the computer generation of random convex hulls
• Generating binary trees at random
• Simpler proof of a realizability theorem on Delaunay triangulations
• Random polytopes: Their definition, generation and aggregate properties
• Monte carlo estimates of the distributions of the random polygons determined by random lines in a plane

This page was built for publication: An optimal algorithm for realizing a Delaunay triangulation