Fast algorithms for greedy triangulation

DOI10.1007/BF01994882MaRDI QIDQ1196458zbMATH OpenOpenAlexFDO

Authors Christos Levcopoulos, Andrzej Lingas

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

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

Cites work

• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• A space efficient greedy triangulation algorithm
• Generalized Delaunay triangulation for planar graphs
• Heuristics for optimum binary search trees and minimum weight triangulation problems
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• On approximation behavior of the greedy triangulation for convex polygons
• Voronoi diagrams with barriers and the shortest diagonal problem

Cited in

(7)

• New results for the minimum weight triangulation problem
• Fast greedy triangulation algorithms.
• A fast heuristic for approximating the minimum weight triangulation
• An Algorithm to Construct Greedy Drawings of Triangulations
• Oriented spanners
• Efficiently updating constrained Delaunay triangulations
• Greedy drawings of triangulations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196458)