A fast algorithm for approximating the detour of a polygonal chain

Computational Geometry: Theory and Applications

Volumn 27, Issue 2, 2004, Pages 123-134

  Ebbers Baumann, Annette ^a   Klein, Rolf ^a   Langetepe, Elmar ^a   Lingas, Andrzej ^b  

^a UNIVERSITY OF BONN   (Germany)

^b LUND UNIVERSITY   (Sweden)

Author keywords

Approximation; Dilation; Maximum detour; Polygonal chains

Indexed keywords

EID: 84867956821     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(03)00046-4     Document Type: Article

References (12)

1. O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe, and G. Rote Generalized self-approaching curves Discrete Appl. Math. 109 2001 3 24
2. H. Alt, C. Knauer, and C. Wenk Bounding the Fréchet distance by the Hausdorff distance Abstracts 17th European Workshop Comput. Geom. 2001 Freie Universität Berlin 166 169
3. R.E. Burkard, B. Klinz, and R. Rudolf Perspectives of Monge properties in optimization Discrete Appl. Math. 70 1996 95 161
4. B. Chazelle Triangulating a simple polygon in linear time Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci. 1990 220 230
5. D. Eppstein Spanning trees and spanners J.-R. Sack, J. Urrutia, Handbook of Computational Geometry 2000 Elsevier Science North-Holland Amsterdam 425 461
6. J. Hershberger An optimal visibility graph algorithm for triangulated simple polygons Algorithmica 4 1989 141 155
7. C. Icking, and R. Klein Searching for the kernel of a polygon: A competitive strategy Proc. 11th Annu. ACM Sympos. Comput. Geom. 1995 258 266
8. C. Icking, R. Klein, and E. Langetepe Self-approaching curves Math. Proc. Cambridge Philos. Soc. 125 1999 441 453
9. J.M. Keil, and C.A. Gutwin Classes of graphs which approximate the complete Euclidean graph Discrete Comput. Geom. 7 1992 13 28
10. G. Narasimhan, and M. Smid Approximating the stretch factor of Euclidean graphs SIAM J. Comput. 30 2000 978 989
11. G. Rote Curves with increasing chords Math. Proc. Cambridge Philos. Soc. 115 1994 1 12
12. R. Seidel A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons Computational Geometry 1 1 1991 51 64