On the geometric dilation of finite point sets

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

Volumn 2906, Issue , 2003, Pages 250-259

  Ebbers Baumann, Annette ^a   Grüne, Ansgar ^a   Klein, Rolf ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Computational geometry; Detour; Dilation; Graph; Network; Spanner; Stretch factor; Transportation network

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPH THEORY; NETWORKS (CIRCUITS);

DETOUR; DILATION; GRAPH; SPANNER; STRETCH FACTOR; TRANSPORTATION NETWORK;

GEOMETRY;

EID: 26844523964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_27     Document Type: Article

References (12)

1. P. Agarwal, R. Klein, Ch. Knauer, and M. Sharir. Computing the detour of polygonal curves. Technical Report B 02-03, FU Berlin, January 2002.
2. O. Aichholzer, F. Aurenhammer, Ch. Icking, R. Klein, E. Langetepe, and G. Rote. Generalized self-approaching curves. Discrete Appl. Math., 109:3-24, 2001.
3. P. Bose, J. Gudmundsson, and M. Smid. Constructing plane spanners of bounded degree and low weight. In Proc. 10th European Symposium on Algorithms, LNCS 2461, Springer-Verlag, pages 234-246, 2001.
4. D. Z. Chen, G. Das, and M. Smid. Lower bounds for computing geometric spanners and approximate shortest paths. Discrete Appl. Math., 110:151-167, 2001.
5. A. Ebbers-Baumann, R. Klein, E. Langetepe, and A. Lingas. A fast algorithm for approximating the detour of a polygonal chain. In Proc. 9th European Symposium on Algorithms, LNCS 2161, Springer-Verlag, pages 321-332, 2001.
6. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier, 1999.
7. A. Grüne. Umwege in Polygonen. Master's thesis, Institut für Informatik I, Universität Bonn, 2002.
8. J. Gudmundsson, Ch. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles revisited. In Proc. 13th Internat. Symp. ISAAC '02, volume 2518 of Lecture Notes Comput. Sci., pages 357-368, 2002.
9. Ch. Icking, R. Klein, and E. Langetepe. Self-approaching curves. Math. Proc. Camb. Phil. Soc., 125:441-453, 1999.
10. R. Kato, K. Imai, and T. Asano. An improved algorithm for the minimum manhattan network problem. In Proc. 13th Internat. Symp. ISAAC '02, volume 2518 of Lecture Notes Comput. Sci., pages 344-356, 2002.
11. S. Langer man, P. Morin, and M. Soss. Computing the maximum detour and spanning ratio of planar chains, trees and cycles. In Proc. 19th Internat. Symp. Theoretical Aspects of Computer Sc., STAGS '02, volume 2285 of Lecture Notes Comput. Sci., pages 250-261, 2002.
12. G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM J. Comput., 30:978-989, 2000.