A space efficient greedy triangulation algorithm

DOI10.1016/0020-0190(89)90122-1zbMath0672.68013OpenAlexW2011766923MaRDI QIDQ1120272

Sally A. Goldman

Publication date: 1989

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

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

zbMATH Keywords

computational geometryminimum-weight triangulationgeneralized Delaunay triangulationgreedy triangulationtrianguation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Algorithms in computer science (68W99)

Related Items (7)

A fast heuristic for approximating the minimum weight triangulation ⋮ Improved heuristics for the minimum weight triangulation problem ⋮ Unnamed Item ⋮ Fast algorithms for greedy triangulation ⋮ Fast greedy triangulation algorithms. ⋮ Fast algorithms for greedy triangulation ⋮ Triangulations intersect nicely

Cites Work

• Generalized Delaunay triangulation for planar graphs
• On approximation behavior of the greedy triangulation for convex polygons
• Unnamed Item
• Unnamed Item

This page was built for publication: A space efficient greedy triangulation algorithm