Improved heuristics for the minimum weight triangulation problem

DOI10.1007/BF02007174MaRDI QIDQ1913901zbMATH OpenOpenAlexFDO

Authors Dian Zhou, Yinfeng Xu

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• A heuristic triangulation algorithm
• A New Heuristic for Minimum Weight Triangulation
• A space efficient greedy triangulation algorithm
• scientific article; zbMATH DE number 3841230 (Why is no real title available?)
• scientific article; zbMATH DE number 3817043 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• 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 a conjecture by Plaisted and Hong
• On stable line segments in all triangulations of a planar point set
• The greedy and Delaunay triangulations are not bad in the average case

Cited in

(1)

• A new subgraph of minimum weight triangulations

This page was built for publication: Improved heuristics for the minimum weight triangulation problem

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