Splitting (complicated) surfaces is hard

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 421-429

  Chambers, Erin W ^a   De Verdière, Éric Colin ^b   Erickson, Jeff ^a   Lazarus, Francis ^c   Whittlesey, Kim ^a  

^a University of Illinois   (France)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c CNRS   (France)

Author keywords

Combinatorial surface; Computational topology; Splitting cycle; Topological graph theory

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; TOPOLOGY;

COMBINATORIAL SURFACE; COMPUTATIONAL TOPOLOGY; SPLITTING CYCLE; TOPOLOGICAL GRAPH THEORY;

COMPUTATIONAL GEOMETRY;

EID: 33748180602     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137918     Document Type: Conference Paper

References (24)

1. E. M. Arkin, S. Khuller, and J. S. B. Mitchell. Geometrie knapsack problems. Algorithmica 10:399-427, 1993.
2. J. Blömer, Computing sums of radicals in polynomial time. Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., 670-677, 1991.
3. S. Cabello. Many distances in planar graphs. Proc. 17th Annu. ACM-SIAM Sympos. Discrete Algorithms, 1213-1220, 2006.
4. S. Cabello and B. Mohar. Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. Proc. 13th Annu. European Sympos. Algorithms, 131-142, 2005. Lecture Notes in Computer Science 3669, Springer-Verlag.
5. J. Chen and Y. Han. Shortest paths on a polyhedron, part I: Computing shortest paths. Int. J. Comput. Geom. Appl. 6(2):127-144, 1996.
6. É. Colin de Verdière and J. Erickson. Tightening non-simple paths and cycles on surfaces. Proc. 17th Annu. ACM-SIAM Sympos. Discrete Algorithms, 192-201, 2006.
7. É. 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, Springer-Verlag.
8. É, Colin de Verdière and F. Lazarus. Optimal systems of loops on an orientable surface. Discrete Comput. Geom. 33(3):507-534, 2005.
9. P. Eades and D. Rappaport. The complexity of computing minimum separating polygons, Pattern Recogn. Lett. 14(9):715-718, 1993.
10. D. Eppstein. Finding the k shortest paths. SIAM J. Computing 28(2):652-673, 1998
11. D. B. A. Epstein, Curves on 2-manifolds and isotopies. Acta Mathematica 115:83-107, 1966.
12. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete Comput. Geom. 31(1):37-59, 2004.
13. J. Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators, Proc. 16th Annu. ACM-SIAM Sympos. Discrete Algorithms, 1038-1046, 2005.
14. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications, SIAM J. Comput. 16(6):1004-1022, 1987.
15. J. Hass and P. Scott. Intersections of curves on surfaces. Israel J. Math. 51:90-120, 1985.
16. A. Hatcher. Algebraic Topology. Cambridge University Press, 2002. 〈http://www.math.cornell.edu/~hatcher/〉.
17. D. S. Johnson and C. H. Papadimitriou. Computational complexity and the traveling salesman problem. The Traveling Salesman Problem, 68-74, 1985. John Wiley & Sons.
18. M. Kutz. Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. These proceedings, 2006.
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. J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou, The discrete geodesic problem, SIAM J. Comput. 16(4):647-668, 1987.
21. B. Mohar and C. Thomassen. Graphs on Surfaces. Johns Hopkins University Press, 2001
22. J. Stillwell. Classical Topology and Combinatorial Group Theory. Springer-Verlag, New York, 1993.
23. J. Takahashi, H. Suzuki, and T. Nishizeki, Shortest noncrossing paths in plane graphs. Algorithmica 16:339-357, 1996
24. A. Zomorodian, Topology for Computing. Cambridge University Press, 2005.