Abstract. In this paper, we use a multiple shooting approach in optimal control to
introduce a novel algorithm for computing an approximate shortest path between two
points on the surface of a convex polytope in 3D. Namely, the polytope is discretized
into subpolytopes, shooting points and a colline[r]