Maximum geodesic routing in the plane with obstacles

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

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: David L. Millman, Matthew O'Meara, Jack Snoeyink, Vishal Verma
• Keywords: CCCG 2010, Computational Geometry, Escape Routes, Geodesic Path, Separate Escape Routes