Document Open Access Logo

Shelling and Sinking Graphs on the Sphere

Authors Jeff Erickson , Christian Howard

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2025.47.pdf
  • Filesize: 2.25 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • morphing
  • planar graphs
  • spherical graph drawing
  • longitudinal shelling

Metrics

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

Abstract

We describe a promising approach to efficiently morph spherical graphs, extending earlier approaches of Awartani and Henderson [Trans. AMS 1987] and Kobourov and Landis [JGAA 2006]. Specifically, we describe two methods to morph shortest-path triangulations of the sphere by moving their vertices along longitudes into the southern hemisphere; we call a triangulation sinkable if such a morph exists. Our first method generalizes a longitudinal shelling construction of Awartani and Henderson; a triangulation is sinkable if a specific orientation of its dual graph is acyclic. We describe a simple polynomial-time algorithm to find a longitudinally shellable rotation of a given spherical triangulation, if one exists; we also construct a spherical triangulation that has no longitudinally shellable rotation. Our second method is based on a linear-programming characterization of sinkability. By identifying its optimal basis, we show that this linear program can be solved in O(n^{ω/2}) time, where ω is the matrix-multiplication exponent, assuming the underlying linear system is non-singular. Finally, we pose several conjectures and describe experimental results that support them.

Cite As Get BibTex

Jeff Erickson and Christian Howard. Shelling and Sinking Graphs on the Sphere. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 47:1-47:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SoCG.2025.47

Author Details

Jeff Erickson
  • University of Illinois Urbana-Champaign, IL, USA
Christian Howard
  • University of Illinois Urbana-Champaign, IL, USA

Acknowledgements

The authors thank Eli Kujawa for early helpful discussions and the anonymous reviewers for their helpful comments and suggestions.

References

  1. Hugo A. Akitaya, Radoslav Fulek, and Csaba D. Tóth. Recognizing weak embeddings of graphs. In Proc. 29th Ann. ACM-SIAM Symp. Discrete Algorithms, pages 274-292, 2018. URL: https://doi.org/10.1137/1.9781611975031.20.
  2. Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, and Bryan T. Wilkinson. How to morph planar graph drawings. SIAM J. Comput., 46(2):824-852, 2017. URL: https://doi.org/10.1137/16M1069171.
  3. Noga Alon and Raphael Yuster. Matrix sparsification and nested dissection over arbitrary fields. J. ACM, 60(4):article 25, 18pp., 2013. URL: https://doi.org/10.1145/2508028.2505989.
  4. Marwan Awartani and David W. Henderson. Spaces of geodesic triangulations of the sphere. Trans. Amer. Math. Soc., 304(2):721-732, 1987. URL: https://doi.org/10.2307/2000738.
  5. Fidel Barrera-Cruz, Penny Haxell, and Anna Lubiw. Morphing Schnyder drawings of planar triangulations. Discrete Comput. Geom., 61(1):161-184, 2019. URL: https://doi.org/10.1007/s00454-018-0018-9.
  6. Therese Biedl, Anna Lubiw, and Jack Spalding-Jamieson. Morphing planar graph drawings via orthogonal box drawings. In Proc. 32nd Int. Symp. Graph Drawing Network Vis., page to appear, 2024. URL: https://doi.org/10.48550/arXiv.2409.04074.
  7. R. H. Bing and Michael Starbird. Linear isotopies in E². Trans. Amer. Math. Soc., 237:205-222, 1978. URL: https://doi.org/10.2307/1997619.
  8. Gunnar Brinkmann. A simple and elementary proof of Whitney’s unique embedding theorem. Ars Math. Contemp., 20(2):195-197, 2021. URL: https://doi.org/10.26493/1855-3974.2334.331.
  9. Heinz Bruggesser and Peter Mani. Shellable decompositions of cells and spheres. Math. Scand., 29:197-205, 1971. URL: https://doi.org/10.7146/math.scand.a-11045.
  10. Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, and Alexander Wolff. Morphing planar graph drawings through 3D. In Proc. 48th Int. Conf. Current Trends in Theory and Practice Comput. Sci. (SOFSEM), volume 13878 of Lecture Notes Comput. Sci., pages 80-95. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-23101-8_6.
  11. Stewart S. Cairns. Deformations of plane rectilinear complexes. Amer. Math. Monthly, 51(5):247-252, 1944. URL: https://doi.org/10.2307/2304300.
  12. Stewart S. Cairns. Isotopic deformations of geodesic complexes on the 2-sphere and on the plane. Ann. Math., 45(2):207-217, 1944. URL: https://doi.org/10.2307/1969263.
  13. Jean Cerf. About the Bloch-Connelly-Henderson theorem on the simplexwise linear homeomorphisms of a convex 2-disk. Preprint, October 2019. URL: https://doi.org/10.48550/arXiv.1910.00240.
  14. Erin Wolf Chambers, Jeff Erickson, Patrick Lin, and Salman Parsa. How to morph graphs on the torus. In Proc. 32nd Ann. ACM-SIAM Symp. Discrete Algorithms, pages 2759-2778, 2021. URL: https://doi.org/10.1137/1.9781611976465.164.
  15. Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, and Alexander Wolff. Morphing rectangular duals. In Proc. 30th Int. Symp. Graph Drawing Network Vis., number 13764 in Lecture Notes Comput. Sci., pages 389-403. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-22203-0_28.
  16. Bernard Chazelle, Leo J. Guibas, and D. T. Lee. The power of geometric duality. BIT Numer. Math., 25(1):76-90, 1985. URL: https://doi.org/10.1007/BF01934990.
  17. Marek Chrobak, Michael T. Goodrich, and Roberto Tamassia. Convex drawings of graphs in two and three dimensions (preliminary version). In Proc. 12th Ann. Symp. Comput. Geom., pages 319-328, 1996. URL: https://doi.org/10.1145/237218.237401.
  18. Krzysztof Diks and Piotr Sankowski. Dynamic plane transitive closure. In Proc. 15th Ann. Europ. Symp. Algorithms, number 4698 in Lecture Notes Comput. Sci., pages 594-604. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-75520-3_53.
  19. Adrien Douady. Le shaddock à six becs. Bull. APMEP, 281:699-701, 1971. URL: https://www.apmep.fr/IMG/pdf/AAA71038.pdf.
  20. Peter Eades, Qingwen Peng, Xuemin Lin, and Hiroshi Nagamochi. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica, 44(1):1-32, 2006. URL: https://doi.org/10.1007/s00453-004-1144-8.
  21. Victor Eberhard. Zur Morphologie der Polyeder. Teubner, 1891. Google Scholar
  22. Herbert Edelsbrunner and Leonidas J. Guibas. Topologically sweeping an arrangement. J. Comput. Syst. Sci., 38(1):165-194, 1989. URL: https://doi.org/10.1016/0022-0000(89)90038-X.
  23. Herbert Edelsbrunner, Joseph O'Rourke, and Raimund Seidel. Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput., 15(2):341-363, 1986. URL: https://doi.org/10.1137/0215024.
  24. Jeff Erickson and Christian Howard. Shelling and sinking graphs on the sphere. Preprint, April 2025. URL: https://doi.org/10.48550/arXiv.2504.05098.
  25. Jeff Erickson and Patrick Lin. Planar and toroidal morphs made easier. In Proc. 29th Int. Symp. Graph Drawing Network Vis., number 12868 in Lecture Notes Comput. Sci., pages 123-137, 2021. URL: https://doi.org/10.1007/978-3-030-92931-2_9.
  26. Cesim Erten, Stephen G. Kobourov, and Chandan Pitta. Intersection-free morphing of planar graphs. In Giuseppe Liotta, editor, Proc. 11th Symp. Graph Drawing, volume 2912 of Lecture Notes Comput. Sci., pages 320-331. Springer, 2003. URL: https://doi.org/10.1007/978-3-540-24595-7_30.
  27. Michael S. Floater. Parametrization and smooth approximation of surface triangulations. Comp. Aided Geom. Design, 14(3):231-250, 1997. URL: https://doi.org/10.1016/S0167-8396(96)00031-3.
  28. Michael S. Floater. Parametric tilings and scattered data approximation. Int. J. Shape Modeling, 4(3-4):165-182, 1998. URL: https://doi.org/10.1142/S021865439800012X.
  29. Michael S. Floater and Craig Gotsman. How to morph tilings injectively. J. Comput. Appl. Math., 101(1-2):117-129, 1999. URL: https://doi.org/10.1016/S0377-0427(98)00202-7.
  30. Radoslav Fulek and Jan Kyncl. Hanani-Tutte for approximating maps of graphs. In Proc. 34th Int. Symp. Comput. Geom., number 99 in Leibniz Int. Proc. Informatics, pages 39:1-39:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.SoCG.2018.39.
  31. Craig Gotsman and Vitaly Surazhsky. Guaranteed intersection-free polygon morphing. Computers & Graphics, 25(1):67-75, 2001. URL: https://doi.org/10.1016/S0097-8493(00)00108-4.
  32. Martin Grötschel, László Lovász, and Alexander Schrijver. Geometric Algorithms and Combinatorial Optimization. Number 2 in Algorithms and Combinatorics. Springer-Verlag, 2nd edition, 1993. URL: https://doi.org/10.1007/978-3-642-78240-4.
  33. Branko Grünbaum. Graphs of polyhedra; polyhedra as graphs. Discrete Math., 307(3-5):445-463, 2007. URL: https://doi.org/10.1016/j.disc.2005.09.037.
  34. Chung-Wu Ho. On certain homotopy properties of some spaces of linear and piecewise linear homeomorphisms. I. Trans. Amer. Math. Soc., 181:213-233, 1973. URL: https://doi.org/10.2307/1996630.
  35. Chung-Wu Ho. Deforming P.L. homeomorphisms on a convex polygonal disk. Pacific J. Math., 55(2):427-439, 1974. URL: https://doi.org/10.2140/pjm.1974.55.427.
  36. Seok-Hee Hong and Hiroshi Nagamochi. Convex drawings of hierarchical planar graphs and clustered planar graphs. J. Discrete Algorithms, 8(3):282-295, 2010. URL: https://doi.org/10.1016/j.jda.2009.05.003.
  37. John E. Hopcroft and Peter J. Kahn. A paradigm for robust geometric algorithms. Algorithmica, 7(1-6):339-380, 1992. URL: https://doi.org/10.1007/BF01758769.
  38. Børge Jessen. Orthogonal icosahedra. Nordisk Matematisk Tidskrift, 15(2/3):90-96, 1967. URL: https://www.jstor.org/stable/24524998.
  39. Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, and Darren Strash. Convexity-increasing morphs of planar graphs. Comput. Geom. Theory Appl., 84:69-88, 2019. URL: https://doi.org/10.1016/j.comgeo.2019.07.007.
  40. Boris Klemz. Convex drawings of hierarchical graphs in linear time, with applications to planar graph morphing. In Proc. 29th Ann. Europ. Symp. Algorithms, number 204 in Leibniz Int. Proc. Informatics, pages 57:1-57:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.ESA.2021.57.
  41. Stephen G. Kobourov and Matthew Landis. Morphing planar graphs in spherical space. J. Graph Algorithms Appl., 12(1):113-127, 2006. URL: https://doi.org/10.7155/jgaa.00162.
  42. Richard J. Lipton, Donald J. Rose, and Robert Endre Tarjan. Generalized nested dissection. SIAM J. Numer. Anal., 16:346-358, 1979. URL: https://doi.org/10.1137/0716027.
  43. Anna Lubiw and Mark Petrick. Morphing planar graph drawings with bent edges. J. Graph Algorithms Appl., 15(2):205-227, 2011. URL: https://doi.org/10.7155/jgaa.00223.
  44. Yanwen Luo, Tianqi Wu, and Xiaoping Zhu. The deformation space of geodesic triangulations of flat tori. Preprint, July 2021. URL: https://doi.org/10.48550/arXiv.2107.05159.
  45. Yanwen Luo, Tianqi Wu, and Xiaoping Zhu. The deformation space of geodesic triangulations and generalized Tutte’s embedding theorem. Geom. Topol., 7:3361-3385, 2023. URL: https://doi.org/10.2140/gt.2023.27.3361.
  46. Yanwen Luo, Tianqi Wu, and Xiaoping Zhu. Spaces of geodesic triangulations are cells. Preprint, August 2024. URL: https://doi.org/10.48550/arXiv.2204.10833.
  47. Jürgen Richter-Gebert. Realization spaces of polytopes. Number 1643 in Lecture Notes Math. Springer, 1996. URL: https://doi.org/10.1007/BFb0093761.
  48. Erich Schönhardt. Über die Zerlegung von Dreieckspolyedern in Tetraeder. Math. Ann., 98(1):309-312, 1928. URL: https://doi.org/10.1007/BF01451597.
  49. Ernst Steinitz. Polyeder und Raumeinteilungen. Enzyklopädie der mathematischen Wissenschaften mit Einschluss ihrer Anwendungen, III.AB(12):1-139, 1916. URL: https://gdz.sub.uni-goettingen.de/id/PPN360609767.
  50. Ernst Steinitz and Hans Rademacher. Vorlesungen über die Theorie der Polyeder: unter Einschluß der Elemente der Topologie. Number 41 in Grundlehren der mathematischen Wissenschaften. Springer-Verlag, 1934. Reprinted 1976. URL: https://doi.org/10.1007/978-3-642-65609-5.
  51. Jorge Stolfi. Oriented projective geometry. In Proc. 3rd Ann. Symp. Comput. Geom., pages 76-85, 1987. URL: https://doi.org/10.1145/41958.41966.
  52. Jorge Stolfi. Primitives for Computational Geometry. Ph.D. thesis, Dept. Comput. Sci., Stanford, May 1988. Reprinted as Technical Report SRC-RR-36, DEC / HP Labs Systems Research Center, January 1989. URL: https://shiftleft.com/mirrors/www.hpl.hp.com/techreports/ Compaq-DEC/SRC-RR-36.pdf.
  53. Jorge Stolfi. Oriented Projective Geometry: A Framework for Geometric Computations. Academic Press, New York, NY, 1991. URL: https://doi.org/10.1016/C2013-0-11551-6.
  54. Fred Supnick. On the perspective deformation of polyhedra. Ann. Math., 49(3):714-730, 1948. URL: https://doi.org/10.2307/1969055.
  55. Fred Supnick. On the perspective deformation of polyhedra. II. Solution of the convexity problem. Math. Ann., 53(2):551-555, 1951. URL: https://doi.org/10.2307/1969572.
  56. Vitaly Surazhsky and Craig Gotsman. Controllable morphing of compatible planar triangulations. ACM Trans. Graphics, 20(4):203-231, 2001. URL: https://doi.org/10.1145/502783.502784.
  57. Vitaly Surazhsky and Craig Gotsman. Morphing stick figures using optimal compatible triangulations. In Proc. 9th Pacific Conf. Comput. Graphics Appl., pages 40-49, 2001. URL: https://doi.org/10.1109/PCCGA.2001.962856.
  58. Vitaly Surazhsky and Craig Gotsman. Intrinsic morphing of compatible triangulations. Int. J. Shape Modeling, 9(2):191-201, 2003. URL: https://doi.org/10.1142/S0218654303000115.
  59. Carsten Thomassen. Deformations of plane graphs. J. Comb. Theory Ser. B, 34(3):244-257, 1983. URL: https://doi.org/10.1016/0095-8956(83)90038-2.
  60. William T. Tutte. How to draw a graph. Proc. London Math. Soc., 13(3):743-768, 1963. URL: https://doi.org/10.1112/plms/s3-13.1.743.
  61. Arthur van Goethem and Kevin Verbeek. Optimal morphs of planar orthogonal drawings. In Proc. 34th Int. Symp. Comput. Geom., number 99 in Leibniz Int. Proc. Informatics, pages 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.SoCG.2018.42.
  62. Hassler Whitney. Congruent graphs and the connectivity of graphs. Amer. J. Math., 54(1):150-168, 1932. URL: https://doi.org/10.2307/2371086.
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact