Embedding point sets into plane graphs of 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 5-16

  Ebbers Baumann, Annette ^a   Grüne, Ansgar ^a   Karpinski, Marek ^a   Klein, Rolf ^a   Knauer, Christian ^b   Lingas, Andrzej ^c  

^a UNIVERSITY OF BONN   (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c LUND UNIVERSITY   (Sweden)

Author keywords

Dilation; Geometric network; Lower bound; Plane graph; Spanning ratio; Stretch factor

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; PROBLEM SOLVING; THEOREM PROVING; TRIANGULATION;

DILATION; GEOMETRIC NETWORKS; LOWER BOUND; PLANE GRAPHS; POINT SETS; SPANNING RATIO; STRETCH FACTOR;

SET THEORY;

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

References (18)

1. P. Agarwal, R. Klein, Ch. Knauer, S. Langerman, P. Morin, M. Sharir, and M. Soss. Computing the Detour and Spanning Ratio of Paths, Trees and Cycles in 2D and 3D. Manuscript, submitted for publication, 2005.
2. T. M. Apostol. Dirichlet Series in Number Theory, 2nd ed. Springer-Verlag, 1997. Pp. 148-155.
3. S. R. Arikati, D. Z. Chen, L. P. Chew, G. Das, and M. Smid. Planar Spanners and Approximate Shortest Path Queries Among Obstacles in the Plane. European Symposium on Algorithms, 514-528, 1996.
4. G. Das and D. Joseph. Which Triangulations Approximate the Complete Graph? Proc. Int. Symp. Optimal Algorithms, Springer LNCS 401, 168-192, 1989.
5. D.P. Dobkin, S.J. Friedman, and K.J. Supowit. Delaunay Graphs Are Almost as Good as Complete Graphs. Discrete & Computational Geometry 5:399-407 (1990).
6. A. Dumitrescu, A. Grüne, and G. Rote. On the Geometric Dilation of Curves and Point Sets. Manuscript, 2004.
7. A. Dumitrescu, A. Ebbers-Baumann, A. Grüne, R. Klein, and G. Rote. On Geometric Dilation and Halving Chords. WADS'05
8. A. Ebbers-Baumann, A. Grüne, and R. Klein, On the Geometric Dilation of Finite Point Sets. 14th International Symposium ISAAC 2003, Kyoto. In T. Ibaraki, N. Katoh, and H. Ono (Eds.) Algorithms and Computation, Proceedings, pp. 250-259, LNCS 2906, Springer-Verlag, 2003. To appear in Algorithmica.
9. A. Ebbers-Baumann, A. Grüne, and R. Klein. Geometric Dilation of Closed Planar Curves: New Lower Bounds. To appear in Computational Geometry: Theory and Applications.
10. A. Ebbers-Baumann, R. Klein, E. Langetepe, and A. Lingas. A Fast Algorithm for Approximating the Detour of a Polygonal Chain. Computational Geometry: Theory and Applications, 27:123-134, 2004.
11. D. Eppstein. Spanning trees and spanners. In Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, editors, pp. 425-461. Elsevier, 1999.
12. D. Eppstein. The Geometry Junkyard, http://www.ics.uci.edu/~eppstein/junkyard/dilation-free/.
13. D. Eppstein and D. Hart. Shortest Paths in an Arrangement with k Line Orientartions. Proceedings 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 310-316, 1999.
14. S. Fekete, R. Klein, and A. Nüchter. Online Searching with an Autonomous Robot. Workshop on Algorithmic Foundations of Robotics, 2004.
15. E. Hlawka. Theorie der Gleichverteilung. BI Wissenschaftsverlag.
16. J.M. Keil and C.A. Gutwin. The Delaunay Triangulation Closely Approximates. the Complete Euclidean Graph. Discrete Comput. Geom. 7, 1992, pp. 13-28.
17. D. Lorenz. On the Dilation of Finite Point Sets. Diploma Thesis. Bonn, 2005.
18. G. Narasimhan and M. Smid. Geometric Spanner Networks. Cambridge University Press, to appear.