A fast heuristic for approximating the minimum weight triangulation

DOI10.1007/3-540-61422-2_140zbMath1502.68332OpenAlexW1507123436MaRDI QIDQ5054821

Drago Krznaric, Christos Levcopoulos

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_140

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A space efficient greedy triangulation algorithm
• A note on Delaunay and optimal triangulations
• Fast algorithms for greedy triangulation
• Approximating the minimum weight Steiner triangulation
• Computing a subgraph of the minimum weight triangulation
• New results for the minimum weight triangulation problem
• The greedy triangulation can be computed from the Delaunay triangulation in linear time
• Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time
• A heuristic triangulation algorithm
• Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time

This page was built for publication: A fast heuristic for approximating the minimum weight triangulation