Encoding homotopy of paths in the plane

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

Volumn 2976, Issue , 2004, Pages 329-338

  Bespamyatnikh, Sergei ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

HOMOTOPIC; HOMOTOPIES; MINIMUM LINK PATH; OUTPUT-SENSITIVE ALGORITHM;

ENCODING (SYMBOLS);

EID: 35048877597     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_37     Document Type: Article

References (13)

1. R. Bar-Yehuda and Bernard Chazelle. Triangulating disjoint Jordan chains. Internat. J. Comput. Georn. Appl., 4(4):475-481, 1994.
2. S. Bespamyatnikh. Computing homotopic shortest paths in the plane. J. Algorithms, 49(2):284-303, 2003.
3. S. Cabello, Y. Liu, A. Mantler, and J. Snoeyink. Testing homotopy for paths in the plane. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pages 160-169, 2002.
4. Bernard Chazelle. A theorem on polygon cutting with applications. In Proc. 23th Annu. IEEE Sympos. Found. Comput. Sci., pages 339-349, 1982.
5. Bernard Chazelle. An algorithm for segment-dragging and its implementation. Algorithmica, 3:205-221, 1988.
6. A. Efrat, S.G. Kobourov, and A. Lubiw. Computing homotopic shortest paths efficiently. In Proc. 10th Annu. European Sympos. Algorithms, pages 411-423, 2002.
7. S. K. Ghosh. Computing visibility polygon from a convex set and related problems. J. Algorithms, 12:75-95, 1991.
8. J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. Comput. Geom. Theory Appl., 4:63-98, 1994.
9. K. Keeler and J. Westbrook. Short encodings of planar graphs and maps. Discrete Applied Mathematics, 58(3):239-252, 1995.
10. D. T. Lee and F. P. Preparata. Euclidean shortest paths in the presence of rectilinear barriers. Networks, 14:393-410, 1984.
11. J. Matoušek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10(2):157-182, 1993.
12. Joseph S. B. Mitchell. Geometric shortest paths and network optimization. In Jörg-Rüdiger Sack and Jorge Urrutia, editors, Handbook of Computational Geometry, pages 633-701. Elsevier Science Publishers B.V, North-Holland, Amsterdam, 2000.
13. J. Ian Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM J. Comput., 31(3):762-776, 2001.