Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2504.05098 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915644281192448 |
|---|---|
| author | Erickson, Jeff Howard, Christian |
| author_facet | Erickson, Jeff Howard, Christian |
| contents | 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. In addition to these main results, we describe a reduction from morphing shortest-path embeddings of 3-connected planar graphs on the sphere to morphing triangulations, and we describe an efficient algorithm that constructs morphs where each intermediate edge has at most one bend. Finally, we pose several conjectures and describe experimental results that support them. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_05098 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Shelling and Sinking Graphs on the Sphere Erickson, Jeff Howard, Christian Computational Geometry 68U05 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. In addition to these main results, we describe a reduction from morphing shortest-path embeddings of 3-connected planar graphs on the sphere to morphing triangulations, and we describe an efficient algorithm that constructs morphs where each intermediate edge has at most one bend. Finally, we pose several conjectures and describe experimental results that support them. |
| title | Shelling and Sinking Graphs on the Sphere |
| topic | Computational Geometry 68U05 |
| url | https://arxiv.org/abs/2504.05098 |