An exact method for finding shortest routes on a sphere, avoiding obstacles
Alan R. Washburn, Gerald G. Brown · Naval Research Logistics (NRL) · 2016
Abstract On the surface of a sphere, we take as inputs two points, neither of them contained in any of a number of spherical polygon obstacles, and quickly find the shortest route connecting these two points while avoiding any obstacle. The WetRoute method presented here has been adopted by the US Navy for several applications. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 374–385, 2016