Fast algorithms for greedy triangulation

DOI10.1007/3-540-52846-6_93zbMath1502.68333OpenAlexW1556301266MaRDI QIDQ5056107

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

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

Related Items (3)

Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time ⋮ The farthest point Delaunay triangulation minimizes angles ⋮ Approximating the minimum weight Steiner triangulation

Cites Work

• Unnamed Item
• 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