Testing Homotopy for Paths in the Plane

Discrete and Computational Geometry

Volumn 31, Issue 1, 2004, Pages 61-81

  Cabello, Sergio ^a   Liu, Yuanxin ^b   Mantler, Andrea ^b   Snoeyink, Jack ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b Brooks Computer Science Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1142300693     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-003-2949-y     Document Type: Conference Paper

References (27)

1. M. A. Armstrong. Basic Topology. McGraw-Hill, London, 1979.
2. M. Ben-Or. Lower bounds for algebraic computation trees. In Proc. 15th Annu. ACM Sympos. Theory Comput., pages 80-86, 1983.
3. J. L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., C-28(9):643-647, September 1979.
4. S. Bespamyatnikh. Computing homotopic shortest paths in the plane. In Proc. 14th ACM-SIAM Sympos. Discrete Algorithm, pages 609-617, 2003.
5. B. Buttenfield. Treatment of the cartographic line. Cartogmphica, 22:1-26, 1985.
6. B. Chazelle. An algorithm for segment-dragging and its implementation. Algorithmica, 3:205-221, 1988.
7. M. de Berg and O. Schwarzkopf. Cuttings and applications. Internat. J. Comput. Geom. Appl., 5:343-355, 1995.
8. M. de Berg, M. van Kreveld, and S. Schirra. A new approach to subdivision simplification. In Proc. 12th Internat. Sympos. Comput.-Assist. Cartog., pages 79-88, 1995.
9. T. K. Dey and S. Guha. Transforming curves on surfaces. J. Comput. System Sec., 58:297-325, 1999.
10. T. K. Dey and H. Schipper. A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection. Discrete Comput. Geom., 14:93-110, 1995.
11. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. J. Comput. System Sci., 38:86-124, 1989.
12. H. Edelsbrunner. A note on dynamic range searching. Bull. EATCS, 15:34-40, 1981.
13. H. Edelsbrunner, L. J. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, and E. Welzl. Implicitly representing arrangements of lines or segments. Discrete Comput. Geom., 4:433-466, 1989.
14. H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph., 9(1):66-104, 1990.
15. A. Efrat, S. G. Kobourov, and A. Lubiw. Computing homotopic shortest paths efficiently. In Proc. ESA'2002, pages 411-423, 2002.
16. J. Erickson. New lower bounds for Hopcroft's problem. Discrete Comput. Geom., 16:389-418, 1996.
17. S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, W. Rülling, and C. Storb. On continuous homotopic one layer routing. In: Proc. Fourth Annu. Sympos. Comput. Geom., pages 392-402, 1988.
18. M. T. Goodrich and R. Tamassia. Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations. J. Algorithms, 23:51-73, 1997.
19. J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. Comput. Geom. Theory Appl., 4:63-98, 1994.
20. J. Hershberger and Subhash Suri. A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Algorithms, 18:403-431, 1995.
21. F. M. Maley. Single-Layer Wire Routing and Compaction. MIT Press, Cambridge, MA, 1990.
22. J. Matoušek. More on cutting arrangements and spanning trees with low crossing number. Technical Report B-90-2, Fachbereich Mathematik, Freie Universität Berlin, Berlin, 1990.
23. J. Matoušek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
24. J. R. Munkres. Topology: A First Course. Prentice-Hall, Englewood Cliffs, NJ, 1975.
25. L. Palazzi and J. Snoeyink. Counting and reporting red/blue segment intersections. CVGIP: Graph. Models Image Process., 56(4):304-311, 1994.
26. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction, 3rd edn. Springer-Verlag, New York, 1990.
27. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.