Landscapes of the Tetrahedron and Cube: An Exploration of Shortest Paths on Polyhedra
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910400322207744 |
|---|---|
| author | Fontenot, Kenzie Raign, Erin Sangalli, August Saso, Emiko Schuerger, Houston Shi, Xin Striff-Cave, Ethan |
| author_facet | Fontenot, Kenzie Raign, Erin Sangalli, August Saso, Emiko Schuerger, Houston Shi, Xin Striff-Cave, Ethan |
| contents | We consider the problem of determining the length of the shortest paths between points on the surfaces of tetrahedra and cubes. Our approach parallels the concept of Alexandrov's star unfolding but focuses on specific polyhedra and uses their symmetries to develop coordinate based formulae. We do so by defining a coordinate system on the surfaces of these polyhedra. Subsequently, we identify relevant regions within each polyhedron's nets and develop formulae which take as inputs the coordinates of the points and produce as an output the distance between the two points on the polyhedron being discussed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2201_04253 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Landscapes of the Tetrahedron and Cube: An Exploration of Shortest Paths on Polyhedra Fontenot, Kenzie Raign, Erin Sangalli, August Saso, Emiko Schuerger, Houston Shi, Xin Striff-Cave, Ethan Metric Geometry We consider the problem of determining the length of the shortest paths between points on the surfaces of tetrahedra and cubes. Our approach parallels the concept of Alexandrov's star unfolding but focuses on specific polyhedra and uses their symmetries to develop coordinate based formulae. We do so by defining a coordinate system on the surfaces of these polyhedra. Subsequently, we identify relevant regions within each polyhedron's nets and develop formulae which take as inputs the coordinates of the points and produce as an output the distance between the two points on the polyhedron being discussed. |
| title | Landscapes of the Tetrahedron and Cube: An Exploration of Shortest Paths on Polyhedra |
| topic | Metric Geometry |
| url | https://arxiv.org/abs/2201.04253 |