Document Open Access Logo

Computing Shortest Closed Curves on Non-Orientable Surfaces

Authors Denys Bulavka, Éric Colin de Verdière, Niloufar Fuladi

PDF
Thumbnail PDF

File

LIPIcs.SoCG.2024.28.pdf
  • Filesize: 1.05 MB
  • 16 pages

Document Identifiers

Author Details

Denys Bulavka
  • Einstein Institute of Mathematics, Hebrew University, Jerusalem, Israel
Éric Colin de Verdière
  • LIGM, CNRS, Univ. Gustave Eiffel, F-77454 Marne-la-Vallée, France
Niloufar Fuladi
  • LORIA, CNRS, INRIA, Université de Lorraine, F-54000 Nancy, France

Funding

  • Bulavka, Denys: Work done while this author was at Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic. This work was initiated while this author was visiting LIGM, funded by the French National Research Agency grant ANR-17-CE40-0033 (SoS), by the grant no. 21-32817S of the Czech Science Foundation (GAČR) and by Charles University project PRIMUS/21/SCI/014.
  • Colin de Verdière, Éric: The work of this author is partly funded by the French National Research Agency grants ANR-17-CE40-0033 (SoS) and ANR-19-CE40-0014 (MIN-MAX).
  • Fuladi, Niloufar: Work done while this author was at LIGM, CNRS, Univ. Gustave Eiffel, F-77454 Marne-la-Vallée, France. The work of this author is partly funded by the French National Research Agency grants ANR-17-CE40-0033 (SoS) and ANR-19-CE40-0014 (MIN-MAX).

Acknowledgements

We would like to thank Arnaud de Mesmay for stimulating discussions, and the anonymous reviewers for their useful comments.

Cite AsGet BibTex

Denys Bulavka, Éric Colin de Verdière, and Niloufar Fuladi. Computing Shortest Closed Curves on Non-Orientable Surfaces. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SoCG.2024.28

Abstract

We initiate the study of computing shortest non-separating simple closed curves with some given topological properties on non-orientable surfaces. While, for orientable surfaces, any two non-separating simple closed curves are related by a self-homeomorphism of the surface, and computing shortest such curves has been vastly studied, for non-orientable ones the classification of non-separating simple closed curves up to ambient homeomorphism is subtler, depending on whether the curve is one-sided or two-sided, and whether it is orienting or not (whether it cuts the surface into an orientable one). We prove that computing a shortest orienting (weakly) simple closed curve on a non-orientable combinatorial surface is NP-hard but fixed-parameter tractable in the genus of the surface. In contrast, we can compute a shortest non-separating non-orienting (weakly) simple closed curve with given sidedness in g^{O(1)} ⋅ n log n time, where g is the genus and n the size of the surface. For these algorithms, we develop tools that can be of independent interest, to compute a variation on canonical systems of loops for non-orientable surfaces based on the computation of an orienting curve, and some covering spaces that are essentially quotients of homology covers.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph algorithms
  • Mathematics of computing → Graphs and surfaces
Keywords
  • Surface
  • Graph
  • Algorithm
  • Non-orientable surface

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Michael O. Albertson and Joan P. Hutchinson. The independence ratio and genus of a graph. Transactions of the American Mathematical Society, 226:161-173, 1977. Google Scholar
  2. Mark Anthony Armstrong. Basic topology. Undergraduate Texts in Mathematics. Springer-Verlag, 1983. Google Scholar
  3. Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, and Amir Nayyeri. Minimum cycle and homology bases of surface-embedded graphs. Journal of Computational Geometry, 8(2):58-79, 2017. Google Scholar
  4. Henry R. Brahana. Systems of circuits on 2-dimensional manifolds. Annals of Mathematics, 23:144-168, 1921. Google Scholar
  5. Sergio Cabello, Erin W. Chambers, and Jeff Erickson. Multiple-source shortest paths in embedded graphs. SIAM Journal on Computing, 42(4):1542-1571, 2013. Google Scholar
  6. Sergio Cabello, Matt DeVos, Jeff Erickson, and Bojan Mohar. Finding one tight cycle. ACM Transactions on Algorithms, 6(4):Article 61, 2010. Google Scholar
  7. Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Francis Lazarus, and Kim Whittlesey. Splitting (complicated) surfaces is hard. Computational Geometry: Theory and Applications, 41(1-2):94-110, 2008. Google Scholar
  8. Erin W. Chambers, Jeff Erickson, Kyle Fox, and Amir Nayyeri. Minimum cuts in surface graphs. SIAM Journal on Computing, 52(1):156-195, 2023. Google Scholar
  9. Hsien-Chih Chang, Jeff Erickson, and Chao Xu. Detecting weakly simple polygons. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1655-1670, 2015. Google Scholar
  10. Éric Colin de Verdière. Shortest cut graph of a surface with prescribed vertex set. In Proceedings of the 18th European Symposium on Algorithms (ESA), part 2, number 6347 in Lecture Notes in Computer Science, pages 100-111, 2010. Google Scholar
  11. Éric Colin de Verdière. Computational topology of graphs on surfaces. In Jacob E. Goodman, Joseph O'Rourke, and Csaba Toth, editors, Handbook of Discrete and Computational Geometry, chapter 23, pages 605-636. CRC Press LLC, third edition, 2018. Google Scholar
  12. Éric Colin de Verdière and Jeff Erickson. Tightening nonsimple paths and cycles on surfaces. SIAM Journal on Computing, 39(8):3784-3813, 2010. Google Scholar
  13. David Eppstein. Dynamic generators of topologically embedded graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 599-608, 2003. Google Scholar
  14. Jeff Erickson. Shortest non-trivial cycles in directed surface graphs. In Proceedings of the 27th Annual Symposium on Computational Geometry (SOCG), pages 236-243. ACM, 2011. Google Scholar
  15. Jeff Erickson, Kyle Fox, and Luvsandondov Lkhamsuren. Holiest minimum-cost paths and flows in surface graphs. In Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC), pages 1319-1332, 2018. Google Scholar
  16. Jeff Erickson and Sariel Har-Peled. Optimally cutting a surface into a disk. Discrete & Computational Geometry, 31(1):37-59, 2004. Google Scholar
  17. Jeff Erickson and Amir Nayyeri. Minimum cuts and shortest non-separating cycles via homology covers. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1166-1176, 2011. Google Scholar
  18. Jeff Erickson and Kim Whittlesey. Greedy optimal homotopy and homology generators. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1038-1046, 2005. Google Scholar
  19. Jeff Erickson and Pratik Worah. Computing the shortest essential cycle. Discrete & Computational Geometry, 44(4):912-930, 2010. Google Scholar
  20. Benson Farb and Dan Margalit. A primer on mapping class groups. Princeton University Press, 2011. Google Scholar
  21. Kyle Fox. Shortest non-trivial cycles in directed and undirected surface graphs. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 352-364, 2013. Google Scholar
  22. Niloufar Fuladi, Alfredo Hubard, and Arnaud de Mesmay. Short topological decompositions of non-orientable surfaces. Discrete & Computational Geometry, pages 1-48, 2023. Google Scholar
  23. Cyril Gavoille and Claire Hilaire. Minor-universal graph for graphs on surfaces. arXiv preprint arXiv:2305.06673, 2023. Google Scholar
  24. Mikhael Gromov. Filling Riemannian manifolds. Journal of Differential Geometry, 18:1-147, 1983. Google Scholar
  25. Jonathan L. Gross and Thomas W. Tucker. Topological graph theory. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., New York, 1987. A Wiley-Interscience Publication. Google Scholar
  26. Francis Lazarus, Michel Pocchiola, Gert Vegter, and Anne Verroust. Computing a canonical polygonal schema of an orientable triangulated surface. In Proceedings of the 17th Annual Symposium on Computational Geometry (SOCG), pages 80-89. ACM, 2001. Google Scholar
  27. Sóstenes Lins. Graph-encoded maps. Journal of Combinatorial Theory, Series B, 32:171-181, 1982. Google Scholar
  28. Jiří Matoušek, Eric Sedgwick, Martin Tancer, and Uli Wagner. Untangling two systems of noncrossing curves. Israel Journal of Mathematics, 212:37-79, 2016. Google Scholar
  29. Neil Robertson and Paul D. Seymour. Graph minors. XVI. Excluding a non-planar graph. Journal of Combinatorial Theory, Series B, 89(1):43-76, 2003. Google Scholar
  30. Marcus Schaefer and Daniel Štefankovič. The degenerate crossing number and higher-genus embeddings. Journal of Graph Algorithms and Applications, 26(1):35-58, 2022. Google Scholar
  31. Carsten Thomassen. Embeddings of graphs with no short noncontractible cycles. Journal of Combinatorial Theory, Series B, 48(2):155-177, 1990. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact