A fast algorithm for approximating the detour of a polygonal chain

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

Volumn 2161, Issue , 2001, Pages 321-332

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

^a UNIVERSITY OF BONN   (Germany)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EUCLIDEAN DISTANCE; FAST ALGORITHMS; POLYGONAL CHAINS; TWO-POINT;

ARTIFICIAL INTELLIGENCE;

EID: 84943261711     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_27     Document Type: Conference Paper

References (11)

1. O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe, and G. Rote. Generalized self-approaching curves. Discrete Appl. Math., 109:3-24, 2001.
2. H. Alt, C. Knauer, and C. Wenk. Bounding the Fréchet distance by the Hausdorff distance. In Abstracts 17th European Workshop Comput. Geom., pages, 166-169. Freie Universität Berlin, 2001.
3. R. E. Burkard, B. Klinz, and R. Rudolf. Perspectives of Monge properties in optimization. Discrete Appl. Math., 70:95-161, 1996.
4. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages, 425-461. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
5. J. Hershberger. An optimal visibility graph algorithm for triangulated simple polygons. Algorithmica, 4:141-155, 1989.
6. C. Icking and R. Klein. Searching for the kernel of a polygon: A competitive strategy. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages, 258-266, 1995.
7. C. Icking, R. Klein, and E. Langetepe. Self-approaching curves. Math. Proc. Camb. Phil. Soc., 125:441-453, 1999.
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. G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM J. Comput., 30:978-989, 2000.
10. G. Rote. Curves with increasing chords. Math. Proc. Camb. Phil. Soc., 115:1-12, 1994.
11. R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl., 1(1):51-64, 1991.