论文信息 - An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation

An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation

On etablit le resultat suivant. Pour tout entier n>4, il existe un ensemble S de n points, tel que |GT(S)|/M(S)=Ω(√n). Si n est grand, alors |GT(S)|/M(S)∼√1/2n

Christos Levcopoulos

[1] A. Lingus,et al. The Greedy and Delaunay Triangulations are Not Bad in the Average Case , 1986, Inf. Process. Lett..

[2] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[3] Peter Gilbert. New Results on Planar Triangulations. , 1979 .

[4] G. Klincsek. Minimal Triangulations of Polygonal Domains , 1980 .

[5] Franco P. Preparata,et al. Computational Geometry , 1985, Texts and Monographs in Computer Science.

[6] Andrzej Lingas. On approximation behavior and implementation of the greedy triangulation for convex planar point sets , 1986, SCG '86.

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

[8] 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..

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