The spanning ratio of the delaunay triangulation is greater than =2

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, CCCG 2009

Volumn , Issue , 2009, Pages 165-167

  Bose, Prosenjit ^a   Devroye, Luc ^b   Löpffler, Maarten ^c   Snoeyink, Jack ^d   Verma, Vishal ^d  

^a CARLETON UNIVERSITY   (Canada)

^b MCGILL UNIVERSITY   (Canada)

^c UTRECHT UNIVERSITY   (Netherlands)

^d UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAU-NAY TRIANGULATIONS; EUCLIDEAN DISTANCE; HIGH PROBABILITY; MAXIMUM RATIO; POINT SET; SHORTEST PATH;

PROBABILITY DISTRIBUTIONS;

COMPUTATIONAL GEOMETRY;

EID: 84882963716     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. M. Abellanas, F. Hurtado, and P. A. Ramos. Structural tolerance and Delauny triangulation. Inf. Process. Lett., 71(5-6):221{227, 1999.
2. L. P. Chew. There are planar graphs almost as good as the complete graph. JCSS, 39:205{219, 989.
3. S. Cui, I. A. Kanj, and G. Xia. On the dilation of Delaunay triangulations of points in convex position. In Proc. 21st CCCG, 2009. This proceedings.
4. E. D. Demaine and J. O'Rourke. Open problems from CCCG 2007. In Proc. 20th CCCG, 2008.
5. D. P. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom., 5:399{407, 1990.
6. A. Ebbers-Baumann, A. Grune, and R. Klein. The geometric dilation of finite point sets. Algorithmica, 44:137{149, 2006.
7. M. Farshi, P. Giannopoulos, and J. Gudmundsson. Finding the best shortcut in a geometric network. In Proc. 21st ACM SCG, pages 327{335, 2005.
8. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom., 7:13{28, 1992.
9. S. Langerman, P. Morin, and M. Soss. Computing the maximum detour and spanning ratio of planar paths, trees, and cycles. In Proc. 19th STACS, volume 2285 of LNCS, pages 250{261. Springer, 2002.
10. G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM Journal on Computing, 30:978{989, 2000.
11. G. Narasimhan and M. Smid. Geometric Spanner Networks. Cambridge University Press, 2007.