Geodesic complexity
Donald M. Davis
Lehigh University, Bethlehem, USA
Download Chapter PDF
A subscription is required to access this book chapter.
Abstract
Geodesic complexity has to do with motion planning when you require the paths to be minimal geodesics. We survey many of the interesting results obtained by Recio-Mitter. Then we focus on two cases, the cube and the 2-point ordered configuration space of a star graph, with a fairly thorough sketch of the proof of the geodesic complexity of each.