Algorithms for geodesics
arXiv:1109.4448 · doi:10.1007/s00190-012-0578-z
Abstract
Algorithms for the computation of geodesics on an ellipsoid of revolution are given. These provide accurate, robust, and fast solutions to the direct and inverse geodesic problems and they allow differential and integral properties of geodesics to be computed.
LaTex, 12 pages, 8 figures. Version 2 corrects some errors and adds numerical examples. Supplementary material is available at http://geographiclib.sourceforge.net/geod.html
References in corpus (1)
Cited by in corpus (10)
- Solution of nonlinear Stokes equations discretized by high-order finite elements on nonconforming and anisotropic meshes, with application to ice sheet dynamics
- A new interpoint distance-based clustering algorithm using kernel density estimation
- Geodesics on an arbitrary ellipsoid of revolution
- Graph-based Village Level Poverty Identification
- Automated Construction of Time-Space Diagrams for Traffic Analysis Using Street-View Video Sequence
- Geodesic intersections
- The area of rhumb polygons
- Maritime Activities Observed Through Open-Access Positioning Data: Moving and Stationary Vessels in the Baltic Sea
- High-Resolution Mapping of Port Dynamics from Open-Access AIS Data in Tokyo Bay
- Spot solutions to a neural field equation on oblate spheroids