Improved heuristics for the minimum weight triangulation problem
From MaRDI portal
Publication:1913901
DOI10.1007/BF02007174zbMath0848.68050OpenAlexW2044096159MaRDI QIDQ1913901
Publication date: 2 June 1996
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02007174
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The greedy and Delaunay triangulations are not bad in the average case
- A space efficient greedy triangulation algorithm
- Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
- New results for the minimum weight triangulation problem
- On stable line segments in all triangulations of a planar point set
- A heuristic triangulation algorithm
- A New Heuristic for Minimum Weight Triangulation
- On a conjecture by Plaisted and Hong
