Efficiently updating constrained Delaunay triangulations

DOI10.1007/BF01989747zbMath0813.68162OpenAlexW1996934342MaRDI QIDQ688628

Cao An Wang

Publication date: 30 November 1993

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01989747

zbMATH Keywords

constrained Delaunay triangulation

Mathematics Subject Classification ID

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

Related Items

Efficiently updating constrained Delaunay triangulations ⋮ Fast greedy triangulation algorithms. ⋮ Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time

Cites Work

• Unnamed Item
• Unnamed Item
• Efficiently updating constrained Delaunay triangulations
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Generalized Delaunay triangulation for planar graphs
• On approximation behavior of the greedy triangulation for convex polygons
• Voronoi diagrams with barriers and the shortest diagonal problem
• Fast algorithms for greedy triangulation