Algorithms for geodesics
Charles F. F. Karney (SRI International)

TL;DR
This paper presents algorithms for accurately and efficiently computing geodesics on an ellipsoid of revolution, enabling precise solutions to direct and inverse problems along with differential and integral geodesic properties.
Contribution
It introduces new algorithms that improve accuracy, robustness, and speed in solving geodesic problems on ellipsoids of revolution.
Findings
Algorithms provide accurate solutions to geodesic problems.
Methods are robust and computationally efficient.
Enable computation of differential and integral geodesic properties.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
