New results for the minimum weight triangulation problem

DOI10.1007/BF01188718zbMath0823.68042OpenAlexW1994135781MaRDI QIDQ1343467

Lenwood S. Heath, Sriram V. Pemmaraju

Publication date: 19 January 1995

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01188718

zbMATH Keywords

minimum spanning treeDelaunay triangulationgreedy triangulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (10)

New results for the minimum weight triangulation problem ⋮ A fast heuristic for approximating the minimum weight triangulation ⋮ Drawing outerplanar minimum weight triangulations ⋮ Improved heuristics for the minimum weight triangulation problem ⋮ On exclusion regions for optimal triangulations ⋮ Fast greedy triangulation algorithms. ⋮ A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations ⋮ An almost four-approximation algorithm for maximum weight triangulation ⋮ A study of the LMT-skeleton ⋮ On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation

Cites Work

• On approximation behavior of the greedy triangulation for convex polygons
• A note on Delaunay and optimal triangulations
• Fast algorithms for greedy triangulation
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• New results for the minimum weight triangulation problem
• A heuristic triangulation algorithm
• A New Heuristic for Minimum Weight Triangulation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New results for the minimum weight triangulation problem