A New Heuristic for Minimum Weight Triangulation

This publication has 10 references indexed in Scilit:

• An efficient algorith for determining the convex hull of a finite planar set
  Published by Elsevier ,2002
• An ω(√n) lower bound for the nonoptimality of the greedy triangulation
  Information Processing Letters, 1987
• The Greedy and Delauney triangulations are not bad in the average case
  Information Processing Letters, 1986
• Computational Geometry
  Published by Springer Nature ,1985
• On the average length of Delaunay triangulations
  BIT Numerical Mathematics, 1984
• Data Structures and Network Algorithms
  Published by Society for Industrial & Applied Mathematics (SIAM) ,1983
• A note on Delaunay and optimal triangulations
  Information Processing Letters, 1980
• Minimal Triangulations of Polygonal Domains
  Published by Elsevier ,1980
• Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation
  Information Processing Letters, 1979
• GRAPH THEORY
  Published by Defense Technical Information Center (DTIC) ,1969