Tightening non-simple paths and cycles on surfaces

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 192-201

  Colin De Verdière, Eric ^a   Erickson, Jeff ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CYCLES; OCTAGONS; PATHS;

BOUNDARY CONDITIONS; GRAPH THEORY; POLYNOMIALS; SET THEORY;

ALGORITHMS;

EID: 33244455859     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. S. Bespamyatnikh. Computing homotopic shortest paths in the plane. J. Algorithms 49(2):284-303, 2003.
2. S. Cabello, Y. Liu, A. Mantler, and J. Snoeyink. Testing homotopy for paths in the plane. Discrete Comput. Geom. 31:61-81, 2004.
3. S. Cabello and B. Mohar. Finding shortest nonseparating and non-contractible cycles for topologically embedded graphs. Proc. 13th Annu. European Sympos. Algorithms, 2005. To appear.
4. É. Colin de Verdière. Raccourcissement de courbes et décomposition de surfaces [Shortening of Curves and Decomposition of Surfaces]. Ph.D. thesis, University of Paris 7, Dec. 2003. (http://www.di.ens. fr/~colin/textes/these.html).
5. É. Colin de Verdière and F. Lazarus. Optimal pants decompositions and shortest homotopic cycles on an orientable surface. Proc. 11th Sympos. Graph Drawing, 478-490, 2003. Lecture Notes Comput. Sci. 2912.
6. É. Colin de Verdière and F. Lazarus. Optimal system of loops on an orientable surface. Discrete Comput. Geom. 33(3):507-534, 2005.
7. M. Dehn. Transformation der Kurven auf zweiseitigen Flächen. Math. Ann. 72:413-421, 1912.
8. T. K. Dey and S. Guha. Transforming curves on surfaces. J. Computer Syst. Sci. 58:297-325, 1999.
9. 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.
10. A. Efrat, S. G. Kobourov, and A. Lubiw. Computing homotopic shortest paths efficiently. Proc. 10th Annu. European Sympos. Algorithms, 411-423, 2002. Lecture Notes Comput. Sci. 2461, Springer-Verlag.
11. D. Eppstein. Dynamic generators of topologically embedded graphs. Proc. 14th Annu ACM-SIAM Sympos. Discrete Algorithms, 599-608, 2003.
12. D. B. A. Epstein. Curves on 2-manifolds and isotopies. Acta Mathematica 115:83-107, 1966.
13. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete Comput. Geom. 31(1):37-59, 2004.
14. J. Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators. Proc. 16th Annu. ACM-SIAM Sympos. Discrete Algorithms, 1038-1046, 2005.
15. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16(6):1004-1022, 1987.
16. A. Hatcher. Algebraic topology. Cambridge University Press, 2002. (http://www.math.cornell.edu/~hatcher/).
17. M. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. System Sci. 55(1, part 1):3-23, 1997.
18. J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. Comput. Geom. TheoryAppl. 4:63-98, 1994.
19. F. Lazarus, M. Pocchiola, G. Vegter, and A. Verroust. Computing a canonical polygonal schema of an orientable triangulated surface. Proc. 17th Annu. ACM Sympos. Comput. Geom., 80-89, 2001.
20. 2(n)) time. SIAM J. Comput. 12(1):71-81, 1983.
21. H. Schipper. Determining contractibility of curves. Proc. 8th Annu. ACM Sympos. Comput. Geom., 358-367, 1992.
22. J. Stillwell. Classical Topology and Combinatorial Group Theory. Springer-Verlag, New York, 1993.
23. G. Vegter and C. K. Yap. Computational complexity of combinatorial surfaces. Proc. 6th Annu. ACM Sympos. Comput. Geom., 102-111, 1990.