Links

Tools

Export citation

Search in Google Scholar

Maximum Geodesic Routing in the Plane with Obstacles

Proceedings article published in 2010 by David L. Millman, Matthew O'Meara ORCID, Jack Snoeyink, Vishal Verma
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Question mark in circle
Preprint: policy unknown
Question mark in circle
Postprint: policy unknown
Question mark in circle
Published version: policy unknown

Abstract

Do convex obstacles in the plane always leave 3 sepa- rate 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.