Fast algorithms for greedy triangulation

DOI10.1007/BF01994882zbMath0761.68099OpenAlexW2004720635MaRDI QIDQ1196458

Andrzej Lingas, Christos Levcopoulos

Publication date: 14 December 1992

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

triangulationVoronoi diagram

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

New results for the minimum weight triangulation problem ⋮ A fast heuristic for approximating the minimum weight triangulation ⋮ Efficiently updating constrained Delaunay triangulations ⋮ Fast greedy triangulation algorithms.

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• A space efficient greedy triangulation algorithm
• Voronoi diagrams with barriers and the shortest diagonal problem
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• Heuristics for optimum binary search trees and minimum weight triangulation problems

This page was built for publication: Fast algorithms for greedy triangulation