Algorithms for geodesics
By Charles F. F. Karney. Journal of Geodesy, 2011
417 citations recorded by the source corpus.
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.
Subfields: Computer Graphics and Computer-Aided Design, Geography, Planning and Development, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/77bb9892626f767b47f250b6b3ca67345b95dfa8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Graphics and Computer-Aided Design
In Geography, Planning and Development
In Geometry and Topology
Citations in the corpus
- An illustrated introduction to general geomorphometry (2017, methodology): “For these surfaces, there are well-developed theory and computational algorithms to solve the inverse geodetic problem (Bagratuni, 1967; Bessel, 1825; Karney, 2013; Morozov, 1979; Sjöberg, 2006; Vincenty, 1975).”
- The Placing Task at MediaEval 2016 (2016, methodology): “We measure geographic distances with Karney’s formula [5]; this formula is based on the assumption that the shape of the Earth is an oblate spheroid, which produces more accurate distances than methods such as the great-circle distance that assume the shape of the Earth to be a sphere.”