Concept

Great circle — where it appears

The intersection of a sphere with a plane through its centre, which is the shortest route between two points on it and is not a straight line on most maps. It is drawn straight only by the gnomonic projection, which is the property that projection was constructed for and the reason it is used for route planning.

Named by 28 essays across 6 fields — each of them below, with the objects they name alongside it.

London to Tokyo on Mercator. Two routes. The great circle is 9559 km and is the shortest path on the sphere. The rhumb line holds a single compass bearing the whole way and is 11296 km — 1737 km further, or 18.2 per cent. On Mercator the rhumb line departs from straight by 5.0e-9 of its own length.

The shortest route is not straight

The shortest path between two points on a sphere is an arc of a great circle, and on almost every map it is a curve. The straight line on a Mercator chart is a different route entirely, and on some journeys it is twenty-eight per cent longer.

paths · Paths
New York to Madrid on Mercator. Two routes. The great circle is 5768 km and is the shortest path on the sphere. The rhumb line holds a single compass bearing the whole way and is 5939 km — 171 km further, or 3.0 per cent. On Mercator the rhumb line departs from straight by 9.6e-16 of its own length.

Why Mercator exists

A ship can hold a compass bearing and cannot easily hold a great circle. Mercator is the answer to one question — what must a map do so that a constant bearing is a straight line — and it answers it exactly.

paths · Paths
London to Tokyo, seen four ways. The same two routes on four projections. The gnomonic projection renders every great circle as an exactly straight line, which is what it is for; Mercator renders every rhumb line straight instead. Neither path changed — only the map did.

The gnomonic companion

One projection turns every great circle into a straight line, and it is the only one that does. It shows less than half the sphere, distorts enormously, and was indispensable for three centuries because of that single exact property.

paths · Paths
London to Tokyo on Orthographic. Two routes. The great circle is 9559 km and is the shortest path on the sphere. The rhumb line holds a single compass bearing the whole way and is 11296 km — 1737 km further, or 18.2 per cent. On Orthographic the rhumb line departs from straight by 2.9e-1 of its own length.

The great-circle vertex

One quantity is constant along a shortest path on a sphere, and it fixes the highest latitude that path will reach before the journey starts. That number is why polar routes exist, and it can be read off the departure bearing without tracing the route at all.

paths · Paths
What treating the Earth as a sphere costs, per journey. The ellipsoidal geodesic minus the spherical great circle, in kilometres, for five journeys. The correction is a few tenths of a per cent and it changes sign: a route running east–west at mid latitude is longer on the ellipsoid, and one running along a meridian is shorter, because an oblate body is fatter round the equator and flatter pole to pole. Both distances are computed — Vincenty's iteration against the haversine formula — and the ellipsoidal one is checked against a geodesic obtained by integrating its own differential equation.

Geodesics on the ellipsoid, and why they are hard

The shortest path on a flattened Earth is not a plane curve, has no closed form, and can be longer or shorter than the spherical answer depending on which way it runs. Every practical method is a series or an iteration, and the correction changes sign.

paths · Paths
Where the inverse problem stops converging, 3° around the antipode of London. Every target in a 6° square centred on the point diametrically opposite London, shaded by how many iterations Vincenty's inverse formula needed to find the geodesic to it. 3 of 625 — 0% — never converged at all, and the worst success took 113 steps against a handful anywhere else on Earth. The failure is not a defect in the formula: near the antipode the shortest path is nearly ambiguous, and an iteration looking for one answer is being asked which of many.

The route with no shortest path

Between a point and the point diametrically opposite there are infinitely many shortest routes and no shortest route, and the standard formula for the distance between two places stops converging in a neighbourhood of it. The failure is a property of the question rather than a defect in the answer.

paths · Paths
London to Tokyo in three straight legs. The great circle, and the route a plan of three constant-heading legs actually follows between waypoints on it. The two touch at the waypoints and part between them by up to 456 km, and the flown route is 253 km longer than the direct one. The headings are 50°, 109°, 149°. Two routes. The great circle is 9559 km and is the shortest path on the sphere. The rhumb line holds a single compass bearing the whole way and is 11296 km — 1737 km further, or 18.2 per cent. On Orthographic the rhumb line departs from straight by 2.4e-1 of its own length.

Flying a curve in straight legs

Nobody steers a great circle, because a great circle requires the heading to change continuously. What is actually flown is a handful of constant-heading legs between waypoints on it, and the gap between plan and curve falls as the square of the number of legs.

paths · Paths
The scale along the Madrid–Tokyo corridor. The scale factor of four projections along the great circle from Madrid to Tokyo, each normalised to its own average over the route so the comparison is of variation rather than of size. The oblique Mercator whose own equator is laid along the corridor holds the scale to 0 parts per million; Mercator varies by 118.7% over the same line. A corridor is a curve, not a region, and the projection an area criterion picks is not the one a curve wants.

Choosing for a line, not a region

Every criterion in this subject integrates over an area. A pipeline, a railway or a coastal survey is a curve, and the projection an area criterion picks for it is not the one it should have — measurably, by a factor of five thousand.

choosing · Choosing
London to Tokyo, round a 15° exclusion. The direct great circle, dashed, runs through the disc. The admissible shortest route leaves it along a great circle tangent to the rim, follows the rim, and leaves along another tangent — which is the closed-form answer and is checked against a shortest-path search over the rim that knows nothing about tangents. It costs 39 kilometres on 9559, which is 0.41 per cent. The rim stretch is 293 kilometres of it, and it is the only part of the route that is not a geodesic anywhere along its length. Drawn in Orthographic.

A route that must go round

Every route on this site so far has been free to go anywhere, and no real route is. The shortest path past a circular exclusion is two tangent great circles and an arc of the rim — a closed form that agrees with a shortest-path search to three metres in 9,598 kilometres — and it costs not the obstacle's size but the square of how far the obstacle reaches past the route.

paths · Paths
The shortest route and the quickest one, in a zonal jet. A craft making 20 km/h through the medium, from 40° north, 34° west to 52° north, 6° east. The great circle is 3313 km and takes 111.6 hours in this flow; the quickest track is 169 km longer — 5.1 per cent further — and takes 99.1 hours, saving 11.2 per cent of the time. The strokes are the flow at its own scale, and the whole difference is that the track bends into the helping part of it. Drawn in Lambert conformal conic.

The quickest route is not the shortest

Every route on this site so far is in a medium that does nothing, so length and time are the same question divided by a constant. Once the water moves, they are different questions with different answers: the quickest track sails five per cent further and arrives eleven per cent sooner, and the journey back takes four times as long as the journey out.

paths · Paths
Where two equal geodesics meet, from 15° north. A geodesic leaving at azimuth α and its mirror image at −α have the same length wherever they meet, and by symmetry they meet on the antipodal meridian. On a sphere they all meet at one point, the antipode, to 1.4e-7° — the flat line. On the ellipsoid the meeting latitude moves with the azimuth, from -15.563° to -15.009°, so the set of points with two shortest routes is an arc 61 km long, and the distance to it varies by 31 km along its own length.

Where the shortest route stops being the only one

On a sphere there is exactly one point with no shortest route from a given place: the antipode. On the ellipsoid the Earth actually is, that point is an arc — sixty-six kilometres of the antipodal meridian for a point on the equator, half a kilometre for one at 85°, and every point of it reachable by two different geodesics of exactly equal length.

paths · Paths
A great circle and the ruled line, on Mercator. The shorter of the two routes is the curved one. The great circle between the two marked points is drawn against the straight line a ruler would give between them on Mercator; over 70° of arc the curve departs from the ruled line by 11.9 per cent of the chord. The flexion at the midpoint, which is the rate the image turns per radian of arc, is 0.788; the angular deformation there is 0.00°.

Tissot stops at the first derivative

Every quantity this site has measured is read off one derivative of the projection. A map can be conformal at a point — the indicatrix a circle, the angular deformation zero to eleven figures — and still bend every geodesic through it, at a rate of 0.839 radians of turning per radian of arc.

distortion · Flexion
Exact distances from two places, and from nowhere else. The two-point equidistant projection with London and Cape Town as its centres, 87.0° apart. The light circles are drawn in the map at radii of 30°, 60°, 90°, 120° about each centre; every one of them is a true distance circle on the sphere, to 1.8e-14 relative. Between two points that are not centres the drawn distance is wrong by up to 633 per cent.

A projection written as a condition

Instead of a formula, a sentence: the distance from these two places must be exactly right. The map that satisfies it is found by intersecting two circles, it is exact to five parts in a hundred million million, and it exists over the whole sphere for a reason that belongs to the sphere rather than to the construction.

choosing · Condition
The route at height does not lie above the route on the ground. London to Tokyo, solved at the surface and again at a stated height, with the two ground tracks compared point for point. At a cruising altitude of eleven kilometres the two part by 11.8 metres; the departure is proportional to the height, at a fitted slope of 0.997. On a sphere the same measurement returns 2.7e-9 metres, because the offset of a sphere is a sphere and the two geodesics coincide exactly. The offset of an ellipsoid is not an ellipsoid, and this is what that costs.

The shortest route is not at sea level

Ten rungs route on a surface and nothing is ever flown on one. The offset of a sphere is a sphere, so at altitude the great circle is the great circle. The offset of an ellipsoid is not an ellipsoid — its radii of curvature are M + h and N + h, which belong to no ellipsoid — so the shortest route at cruising height does not lie above the shortest route on the ground.

paths · Paths
A straight line stored in Web Mercator, and where it really goes. Two points 5570 kilometres apart, joined by a straight segment in the plane the file's coordinates are in. Drawn on that plane it is a straight line and looks like the route; on the ground it is the curve marked measured, and the geodesic between the same two endpoints is the other one. The profile below is the distance between them along the line, reaching 718 kilometres at 49 per cent of the way across. Nothing here is an error in the data: both endpoints are exact, and the whole of the discrepancy is the word straight.

A straight segment is a claim about a plane

Two exact endpoints, joined by a straight line in the plane the file is stored in. On the ground the line is 718 kilometres from the route it claims between New York and London, and 2,961 between London and Tokyo. The departure grows as the square of the length — fitted exponent 2.001 — so a stated tolerance costs vertices as a square root.

applied · Dataset
Everywhere within 3,000 km of London, drawn in Lambert cylindrical. The set of places exactly 3,000 kilometres from London by the shortest route, projected point by point. On the ground it is a circle — every point of it is the same distance from the centre, in every direction. On this page the longest radius from the drawn centre is 4.17 times the shortest, so a reader with a ruler measures two different distances for one ground distance depending on which way the ruler points. The two extreme radii are drawn.

A circle of a distance is not a circle

Eleven essays in this field have followed a route across a map. A range ring is not a route — it is the edge of a set — and drawing one exposes a failure the route essays cannot: the same ground distance comes out 4.17 times longer in one direction than another on a common projection, and 13.03 times at 70° north.

paths · Reach

A map that cannot be read backwards

Craig's projection answers one question exactly — lay a straight edge from any place to the centre and read the compass course, right to 6 × 10⁻¹⁴ of a degree. It pays by folding: 78°S and 48°S on the same meridian are drawn at the same point, so no inverse exists and nothing else can be read off it at all.

choosing · Condition

Nearest of many is a partition

One reach question with one source is a disc. With several sources it is a division of the whole surface, every place belonging to whichever source is nearest — and computing that division in the plane the data is stored in hands away between 0.75 and 22.16 per cent of the ground, in unbroken strips up to 1,591 kilometres across.

paths · Reach

A corridor has a width the page cannot keep

Buffering a line is the most-run operation in spatial analysis and the corridor it produces is a reach set with two failures nobody separates: stroked on the page, one width covers 190 to 471 kilometres of ground along a single route; computed in closed form, the formula stops being the area at a width the route's own length fixes, and eventually claims more ground than the sphere has.

paths · Reach

The line drawn straight on the page is a route

Eleven essays draw the route on the map. Nobody has drawn the map's own proposal: the ground curve somebody follows by laying a ruler on the page. It has a name on exactly two projections and is 18.2 per cent long on the one where it is famous.

paths · Paths

A reach set with a cost that depends on direction

Three rungs build reach sets out of a distance, which is symmetric and isotropic by construction. Nothing anybody travels is: in a flow at 45 per cent of a vehicle's own speed the same vehicle gets 4,261 kilometres one way and 1,653 the other — a ratio of 2.58 — while the ground it covers grows by ten per cent.

paths · Reach

Inside is a claim about the edges

Whether a point is inside a polygon is not a property of the point and the polygon. It is a property of the plane the edges were understood to be straight in, and between two readings of the same file there is a band of disagreement — 29 per cent of one triangle's area, 4.2 million square kilometres, and the file does not say which reading it means.

applied · Dataset

The shortest route a vehicle can fly

Nine rungs find the shortest path under a metric and none asks whether the thing travelling can follow it. Bound the curvature and the route depends on two headings as well as two positions: the turning cost is a fixed 1.81 kilometres whatever the leg length, so it is 18 per cent of a short leg and 0.28 per cent of a long one, and the whole of it vanishes when the vehicle happens to be pointing the right way.

paths · Paths

The shortest route between two coasts

Ten rungs find the shortest path between two points. Between two regions the answer is attained at a pair of boundary points, and which pair is not the pair any page makes look nearest — a cylindrical map picks a pair 2,135 kilometres from the right one across the Atlantic, and 1,716 kilometres wrong between Chile and New Zealand, where its route is 22.5 per cent long.

paths · Paths

The gnomonic crosses a seam without a corner

Eight rungs choose a solid, a face map and where to cut. This one is about a seam the net does not cut, where two faces stay joined and carry two different maps — and the expectation was a corner in every feature crossing one. At the midpoint of the edge — which is where every crossing here is taken, and which turns out to be the one place on it a face's own mirror forces the corner to vanish — the gnomonic gives none at any obliquity on any Platonic solid, and the equal-area face map gives one of up to 0.39 degrees.

families · Polyhedral

One sentence, and the ground between its readings

Every land boundary in the world is defined by a sentence, and a sentence naming two monuments does not name a curve. "A straight line" between the Rio Grande and the Colorado admits at least three answers 7.53 kilometres apart at their worst; "the forty-ninth parallel" admits four, 96 kilometres apart, with 130,972 square kilometres between the extremes.

practice · Boundary

The line a commission can actually run

A boundary commission cannot run a parallel of latitude. It can sight a straight line between monuments, and a straight line between two points of equal latitude passes poleward of the parallel — by s² tan φ / 8R, which at a mile of spacing is fifty-eight millimetres and at a hundred kilometres is two hundred and twenty-six metres. The described line and the marked line are different curves, and the marked one governs.

practice · Boundary

Cells that are rectangles in no coordinate

The previous rung measured what moving a field between two cell schemes costs, and did it between two schemes whose cells are longitude–latitude rectangles — which is what made every overlap a rectangle with a closed-form area. The schemes anybody actually argues about have cells that are rectangles in no coordinate, and their overlaps have to be clipped.

applied · Cells

Named alongside it

The objects these essays reach for when they reach for this one.

GeodesicGnomonicVerificationBoundaryClosed formMercatorAreaNavigationToleranceBearingEllipsoidPurpose

All concepts