The Greedy and Delaunay Triangulations are Not Bad in the Average Case

[1]  David G. Kirkpatrick,et al.  A Note on Delaunay and Optimal Triangulations , 1980, Inf. Process. Lett..

[2]  Glenn K. Manacher,et al.  Neither the Greedy Nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation , 1979, Inf. Process. Lett..

[3]  Errol L. Lloyd.  On triangulations of a set of points in the plane , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[5]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[6]  Frank Harary,et al.  Graph Theory , 2016 .