A fast heuristic for approximating the minimum weight triangulation

DOI10.1007/3-540-61422-2_140MaRDI QIDQ5054821zbMATH OpenOpenAlexFDO

Authors 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

• A heuristic triangulation algorithm
• A note on Delaunay and optimal triangulations
• A space efficient greedy triangulation algorithm
• Approximating the minimum weight Steiner triangulation
• Computing a subgraph of the minimum weight triangulation
• Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time
• Fast algorithms for greedy triangulation
• Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
• scientific article; zbMATH DE number 4155925 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1156715 (Why is no real title available?)
• scientific article; zbMATH DE number 871937 (Why is no real title available?)
• New results for the minimum weight triangulation problem
• The greedy triangulation can be computed from the Delaunay triangulation in linear time

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

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