Sparse geometric graphs with small dilation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 50-59

  Aronov, Boris ^a   De Berg, Mark ^b   Cheong, Otfried ^c   Gudmundsson, Joachim ^d   Haverkort, Herman ^b   Vigneron, Antoine ^e  

^a POLYTECHNIC UNIVERSITY   (United States)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^d CSIRO   (Australia)

^e NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GEOMETRY; NUMBER THEORY; SET THEORY; THEOREM PROVING;

CONVEX POSITIONS; GEOMETRIC GRAPHS; SMALL DILATIONS; VERTEX SETS;

GRAPH THEORY;

EID: 33744953548     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_7     Document Type: Conference Paper

References (19)

1. K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Frieder. Geometrie spanners for wireless ad hoc networks, IEEE Trans. Parallel Dist. Systems, 14(4):408-421, 2003.
2. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42:67-90, 1995.
3. B. Chandra, G. Das, G. Narasimhan, and J. Soares. New sparseness results on graph spanners. Internat, J. Comput. Geom. Appl., 5:124-144, 1995.
4. G. Das and P. Heffernan. Constructing Degree-3 Spanners with Other Sparseness Properties. Int. J. Found. Comput. Sci., 7(2):121-136, 1996.
5. M. do Carmo. Differential Geometry of Curves and Surfaces. Prentice Hall, Englewood Cliffs, NJ, 1976.
6. Y. Emek and D. Peleg. Approximating minimum max-stretch spanning trees on unweighted graphs (full version). In Proc. ACM-SIAM Symp. Discrete Algo., pages 261-270, 2004.
7. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier Science Publishers, Amsterdam, 2000.
8. D. Eppstein and K. Wortman. Minimum dilation stars. In Proc. ACM Symp. Comput. Geom., pages 321-326, 2005.
9. A. M. Farley, A. Proskurowski, D. Zappala, and K. J. Windisch. Spanners and message distribution in networks. Discrete Appl. Math., 137(2):159-171, 2004.
10. S. P. Fekete and J. Kremer. Tree spanners in planar graphs. Discrete Appl. Math., 108:85-103, 2001.
11. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom., 7:13-28, 1992.
12. C. Levcopoulos and A. Lingas. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica, 8:251-256, 1992.
13. X.-Y. Li. Applications of computational geomety in wireless ad: hoc networks. In X.-Z. Cheng, X. Huang, and D.-Z. Du, editors, Ad Hoc Wireless Networking. Kluwer, 2003.
14. G. Navarro and R. Paredes. Practical construction of metric t-spanners. In Proc. 5th Workshop Algorithm Eng. Exp., pages 69-81. SIAM Press, 2003.
15. G. Navarro, R. Paredes, and E. Chez, t-spanners as a data structure for metric space searching. In Proc. 9th Int. Symp. String Proc. Inf. Retrieval, volume 2476 of Lecture Notes in Computer Science, pages 298-309. Springer-Verlag, 2002.
16. J. S. Salowe. Constructing multidimensional spanner graphs. Internat. J. Comput. Geom., 1:99-107, 1991.
17. M. Smid. Closest point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 877-935. Elsevier Science Publishers, Amsterdam, 2000.
18. P. M. Vaidya. A sparse graph almost as good as the complete graph on points in K dimensions. Discrete Comput. Geom., 6:369-381, 1991.
19. A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput., 11, 1992.