Abstract
A pants decomposition of a compact orientable surface M is a set of disjoint simple cycles which cuts M into pairs of pants, i.e., spheres with three boundaries. Assuming M is a polyhedral surface, with weighted vertex-edge graph G, we consider combinatorial pants decompositions: the cycles are closed walks in G that may overlap but do not cross.
We give an algorithm which, given a pants decomposition, computes a homotopic pants decomposition in which each cycle is a shortest cycle in its homotopy class. In particular, the resulting decomposition is optimal (as short as possible among all homotopic pants decompositions), and any optimal pants decomposition is made of shortest homotopic cycles. Our algorithm is polynomial in the complexity of the input and in the longest-to-shortest edge ratio of G. The same algorithm can be applied, given a simple cycle C, to compute a shortest cycle homotopic to C which is itself simple.
A preliminary short version of this paper appeared in the Abstracts of the 19th European Workshop on Computational Geometry, 2003.
Chapter PDF
Similar content being viewed by others
References
Buser, P.: Geometry and spectra of compact Riemann surfaces. Progress in Mathematics, vol. 106. Birhäuser (1992)
Colin de Verdière, É., Lazarus, F.: Optimal system of loops on an orientable surface. In: IEEE Symp. Found. Comput. Sci., pp. 627–636 (2002)
Epstein, D.: Curves on 2-manifolds and isotopies. Acta Mathematica 115, 83–107 (1966)
Erickson, J., Har-Peled, S.: Optimally cutting a surface into a disk. In: Proc. 18th Annu. ACM Symp. Comput. Geom., pp. 244–253 (2002)
Hatcher, A.: Pants decompositions of surfaces (2000), http://www.math.cornell.edu/~hatcher/Papers/pantsdecomp.pdf
Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Computational Geometry: Theory and Applications 4, 63–98 (1994)
Massey, W.S.: Algebraic Topology: An Introduction. Graduate Texts in Mathematics, vol. 56. Springer, Heidelberg (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Verdière, É.C., Lazarus, F. (2004). Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface. In: Liotta, G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive