Geodesic complexity of a tetrahedron
arXiv:2306.11059
Abstract
We prove that the geodesic complexity of a regular tetrahedron exceeds its topological complexity by 1 or 2. The proof involves a careful analysis of minimal geodesics on the tetrahedron.