Geodesic complexity of the octahedron, and an algorithm for cut loci on convex polyhedra

Florian Frick, Pranav Rajbhandari

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. W…