Maximum geodesic routing in the plane with obstacles
Matthew J. O’Meara, L. Millman, Jack Scott Snoeyink, Vishal Verma · Canadian Conference on Computational Geometry · 2010
Do convex obstacles in the plane always leave 3 separate escape routes? Here, an escape route is a locally geodesic path that avoids the obstacles; escape routes are separate if they have no point in common but their origin. We answer this question, posed at FWCG ’09 by Al-Jubeh, Ishaque and T oth, in the armative and show how to eciently compute the routes.