An exact method for finding shortest routes on a sphere, avoiding obstacles: Finding Shortest Routes on a Sphere, Avoiding Obstacles
Brown, Gerald G.
MetadataShow full item record
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.
The article of record as published may be found at http://dx.doi.org/.10.1002/nav.21702
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Giraldo, F.X. (1997);Lagrange-Galerkin finite element methods that are high-order accurate, exactly integrable, and highly efficient are presented. This paper derives generalized natural Cartesian coordinates in three dimensions for linear ...
Giraldo, F.X. (2001);The spectral element method for the two-dimensional shallow water equations on the sphere is presented. The equations are written in conservation form and the domains are discretized using quadrilateral elements obtained ...
Giraldo, F.X.; Perot, J. B.; Fischer, P. F. (2003);A spectral element semi-Lagrangian (SESL) method for the shallow water equations on the sphere is presented. The sphere is discretized using a hexahedral grid although any grid imaginable can be used as long as it is ...