Greedy triangulation can be efficiently implemented in the average case

This publication has 11 references indexed in Scilit:

• Computational geometry column 9
  ACM SIGACT News, 1990
• On approximation behavior of the greedy triangulation for convex polygons
  Algorithmica, 1987
• The Greedy and Delauney triangulations are not bad in the average case
  Information Processing Letters, 1986
• On the average length of Delaunay triangulations
  BIT Numerical Mathematics, 1984
• Triangulating Simple Polygons and Equivalent Problems
  ACM Transactions on Graphics, 1984
• Optimal Expected-Time Algorithms for Closest Point Problems
  ACM Transactions on Mathematical Software, 1980
• A note on Delaunay and optimal triangulations
  Information Processing Letters, 1980
• Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation
  Information Processing Letters, 1979
• On triangulations of a set of points in the plane
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1977
• Fast probabilistic algorithms for hamiltonian circuits and matchings
  Published by Association for Computing Machinery (ACM) ,1977