Fast algorithms for greedy triangulation

DOI10.1007/3-540-52846-6_93MaRDI QIDQ5056107zbMATH OpenOpenAlexFDO

Authors Christos Levcopoulos, Andrzej Lingas

Publication date 9 December 2022

Published in SWAT 90 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52846-6_93

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

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 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 4064506 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (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

(5)

• The farthest point Delaunay triangulation minimizes angles
• Approximating the minimum weight Steiner triangulation
• An Algorithm to Construct Greedy Drawings of Triangulations
• Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
• 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 Q5056107)