Introduction to the geodesic problem (original) (raw)

The shortest path between two points on the ellipsoid at (lat1, lon1) and (lat2, lon2) is called the geodesic. Its length is s12 and the geodesic from point 1 to point 2 has forward azimuths azi1 and azi2 at the two end points.

Traditionally two geodesic problems are considered:

The ellipsoid is specified by its equatorial radius a (typically in meters) and flattening f. The routines are accurate to round off with double precision arithmetic provided that |f| < 1/50; for the WGS84 ellipsoid, the errors are less than 15 nanometers. (Reasonably accurate results are obtained for |f| < 1/5.) For a prolate ellipsoid, specify f < 0.

The routines also calculate several other quantities of interest

If points 1, 2, and 3 lie on a single geodesic, then the following addition rules hold:

The shortest distance returned by the solution of the inverse problem is (obviously) uniquely defined. However, in a few special cases there are multiple azimuths which yield the same shortest distance. Here is a catalog of those cases:

The area of a geodesic polygon can be determined by summing −S12 for successive edges of the polygon (S12 is negated so that clockwise traversal of a polygon gives a positive area). However, if the polygon encircles a pole, the sum must be adjusted by ±A/2, where A is the area of the full ellipsoid, with the sign chosen to place the result in (−A/2, A/2].

The principal advantages of these algorithms over previous ones (e.g., Vincenty, 1975) are