This page illustrates the geodesic routines available in GeographicLib. The C++ code has been converted to JavaScript so the calculations are carried out on the client. The algorithms are considerably more accurate than Vincenty's method, and offer more functionality (an inverse method which never fails to converge, differential properties of the geodesic, and the area under a geodesic). The algorithms are derived in

Charles F. F. Karney,This page just provides a basic interface. Enter latitudes, longitudes, and azimuths as degrees and distances as meters using spaces or commas as separators. (Angles may be entered as decimal degrees or as degrees, minutes, and seconds, e.g. -20.51125, 20°30′40.5″S, S20d30'40.5", or -20:30:40.5.) The results are accurate to about 15 nanometers (or 0.1 m

Algorithms for geodesics,

J. Geodesy87(1), 43–55 (Jan. 2013);

DOI: 10.1007/s00190-012-0578-z (pdf); addenda: geod-addenda.html.

Jump to:

- Inverse problem
- Direct problem
- Geodesic path
- Polygon area
- Geodesic lines, circles, and envelopes in Google Maps

Charles Karney <charles@karney.com> (2011-08-04)

Geographiclib Sourceforge