Geodesic complexity of the octahedron, and an algorithm for cut loci on convex polyhedra
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912581222924288 |
|---|---|
| author | Frick, Florian Rajbhandari, Pranav |
| author_facet | Frick, Florian Rajbhandari, Pranav |
| contents | The geodesic complexity of a length space $X$ quantifies the required number of case distinctions to continuously choose a shortest path connecting any given start and end point. We prove a local lower bound for the geodesic complexity of $X$ obtained by embedding simplices into $X\times X$. We additionally create and prove correctness of an algorithm to find cut loci on surfaces of convex polyhedra, as the structure of a space's cut loci is related to its geodesic complexity. We use these techniques to prove the geodesic complexity of the octahedron is four. Our method is inspired by earlier work of Recio-Mitter and Davis, and thus recovers their results on the geodesic complexity of the $n$-torus and the tetrahedron, respectively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_19362 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Geodesic complexity of the octahedron, and an algorithm for cut loci on convex polyhedra Frick, Florian Rajbhandari, Pranav Metric Geometry Computational Geometry 53C22, 52B10, 55M30 The geodesic complexity of a length space $X$ quantifies the required number of case distinctions to continuously choose a shortest path connecting any given start and end point. We prove a local lower bound for the geodesic complexity of $X$ obtained by embedding simplices into $X\times X$. We additionally create and prove correctness of an algorithm to find cut loci on surfaces of convex polyhedra, as the structure of a space's cut loci is related to its geodesic complexity. We use these techniques to prove the geodesic complexity of the octahedron is four. Our method is inspired by earlier work of Recio-Mitter and Davis, and thus recovers their results on the geodesic complexity of the $n$-torus and the tetrahedron, respectively. |
| title | Geodesic complexity of the octahedron, and an algorithm for cut loci on convex polyhedra |
| topic | Metric Geometry Computational Geometry 53C22, 52B10, 55M30 |
| url | https://arxiv.org/abs/2508.19362 |