Skip to main content
Log in

Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

A closed quasigeodesic on a convex polyhedron is a closed curve that is locally straight outside of the vertices, where it forms an angle at most \(\pi \) on both sides. While the existence of a simple closed quasigeodesic on a convex polyhedron has been proved by Pogorelov in 1949, finding a polynomial-time algorithm to compute such a simple closed quasigeodesic has been repeatedly posed as an open problem. Our first contribution is to propose an extended definition of quasigeodesics in the intrinsic setting of (not necessarily convex) polyhedral spheres, and to prove the existence of a weakly simple closed quasigeodesic in such a setting. Our proof does not proceed via an approximation by smooth surfaces, but relies on an adaptation of the disk flow of Hass and Scott to the context of polyhedral surfaces. Our second result is to leverage this existence theorem to provide a finite algorithm to compute a weakly simple closed quasigeodesic on a polyhedral sphere. On a convex polyhedron, our algorithm computes a simple closed quasigeodesic, solving an open problem of Demaine, Hersterberg, and Ku.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

Notes

  1. In this proof, we call altitude the distance from E to [AB]. If the triangle AEB has an obtuse angle at its base, then this notion of altitude does not coincide with the usual notion, i.e., the distance from E to (AB).

  2. If there is an infinite number of them, they are parameterized in \(\beta \) by a closed interval. We then consider the representative closest to the interior of the star.

References

  1. Akitaya, H.A., Aloupis, G., Erickson, J., Tóth, Cs.D.: Recognizing weakly simple polygons. Discrete Comput. Geom. 58(4), 785–821 (2017)

  2. Aleksandrov, A.D.: Convex Polyhedra. Gosudarstv. Izdat. Tehn.-Teor. Lit., Moscow (1950). (in Russian)

  3. Alexandrov, A.D.: Convex Polyhedra. Springer Monographs in Mathematics. Springer, Berlin (2005)

  4. Ballmann,W.: Der Satz von Lusternik und Schnirelmann. In: Beiträge zur Differentialgeometrie, vol. 1. Bonner Math. Schriften, vol. 102, pp. 1–25. University of Bonn, Bonn (1978)

  5. Ballmann, W., Thorbergsson, G., Ziller, W.: On the existence of short closed geodesics and their stability properties. In: Seminar on Minimal Submanifolds. Annals of Mathematics Studies, vol. 103, pp. 53–63. Princeton University Press, Princeton (1983)

  6. Birkhoff, G.D.: On the periodic motions of dynamical systems. Acta Math. 50(1), 359–379 (1927)

    Article  MathSciNet  Google Scholar 

  7. Bobenko, A.I., Izmestiev, I.: Alexandrov’s theorem, weighted Delaunay triangulations, and mixed volumes. Ann. Inst. Fourier (Grenoble) 58(2), 447–505 (2008)

    Article  MathSciNet  Google Scholar 

  8. Bruggesser, H., Mani, P.: Shellable decompositions of cells and spheres. Math. Scand. 29, 197–205 (1971)

    Article  MathSciNet  Google Scholar 

  9. Burago, D., Burago, Yu., Ivanov, S.: A Course in Metric Geometry. Graduate Studies in Mathematics, vol. 33. American Mathematical Society, Providence (2001)

  10. Burago, Yu.D., Zalgaller, V.A.: Isometric piecewise-linear embeddings of two-dimensional manifolds with a polyhedral metric into \(\mathbb{R}^3\). Algebra i Analiz 7(3), 76–95 (1995). (in Russian)

  11. Chambers, E.W., Chambers, G.R., de Mesmay, A., Ophelders, T., Rotman, R.: Constructing monotone homotopies and sweepouts. J. Differ. Geom. 119(3), 383–401 (2021)

    Article  MathSciNet  Google Scholar 

  12. Chang, H.-Ch., Erickson, J., Xu, Ch.: Detecting weakly simple polygons. In: 26th Annual ACM-SIAM Symposium on Discrete Algorithms (San Diego 2015), pp. 1655–1670. SIAM, Philadelphia (2015)

  13. Demaine, E.D., Hesterberg, A.C., Ku, J.S.: Finding closed quasigeodesics on convex polyhedra. In: 36th International Symposium on Computational Geometry. Leibniz International Proceedings in Informatics, vol. 164, # 33. Leibniz-Zent. Inform., Wadern (2020)

  14. Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, Cambridge (2007)

    Book  Google Scholar 

  15. Devadoss, S.L., O’Rourke, J.: Discrete and Computational Geometry. Princeton University Press, Princeton (2011)

    Google Scholar 

  16. Erickson, J., Nayyeri, A.: Tracing compressed curves in triangulated surfaces. Discrete Comput. Geom. 49(4), 823–863 (2013)

    Article  MathSciNet  Google Scholar 

  17. Grayson, M.A.: Shortening embedded curves. Ann. Math. 129(1), 71–111 (1989)

    Article  MathSciNet  Google Scholar 

  18. Hass, J., Scott, P.: Shortening curves on surfaces. Topology 33(1), 25–43 (1994)

    Article  MathSciNet  Google Scholar 

  19. Jost, J.: Nonpositive Curvature: Geometric and Analytic Aspects. Lectures in Mathematics ETH Zürich. Birkhäuser, Basel (1997)

  20. Kane, D., Price, G.N., Demaine, E.D.: A pseudopolynomial algorithm for Alexandrov’s theorem. In: 11th International Symposium on Algorithms and Data Structures (Banff 2009). Lecture Notes in Computer Science, vol. 5664, pp. 435–446. Springer, Berlin (2009)

  21. Klingenberg, W.P.A.: Riemannian Geometry. De Gruyter Studies in Mathematics, vol. 1. De Gruyter, Berlin (1995)

    Book  Google Scholar 

  22. Lusternik, L., Schnirelmann, L.: Sur le problème de trois géodésiques fermées sur les surfaces de genre \(0\). C. R. Acad. Sci. Paris 189, 269–271 (1929)

  23. O’Rourke, J., Vîlcu, C.: Simple closed quasigeodesics on tetrahedra. Information 13(5), # 238 (2022)

  24. Pogorelov, A.V.: Quasi-geodesic lines on a convex surface. Mat. Sbornik 67(2), 275–306 (1949). (in Russian)

  25. Poincaré, H.: Sur les lignes géodésiques des surfaces convexes. Trans. Am. Math. Soc. 6(3), 237–274 (1905)

    Google Scholar 

  26. Sharp, N., Crane, K.: You can find geodesic paths in triangle meshes by just flipping edges. ACM Trans. Graph. 39(6), # 249 (2020)

  27. Sharp, N., Soliman, Y., Crane, K.: Navigating intrinsic triangulations. ACM Trans. Graph. 38(4), # 55 (2019)

  28. Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)

    Google Scholar 

Download references

Acknowledgements

We thank Francis Lazarus for insightful discussions, and Joseph O’Rourke and the anonymous reviewers for very helpful comments. This research was partially supported by the ANR project Min-Max (ANR-19-CE40-0014)), the ANR project SoS (ANR-17-CE40-0033), and the Bézout Labex, funded by ANR, reference ANR-10-LABX-58.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Jean Chartier or Arnaud de Mesmay.

Additional information

Editor in Charge: Kenneth Clarkson

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chartier, J., de Mesmay, A. Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres. Discrete Comput Geom 71, 95–120 (2024). https://doi.org/10.1007/s00454-023-00511-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-023-00511-2

Keywords

Mathematics Subject Classification

Navigation