Cartographic Projection
every map is wrong, and by exactly how much
Figure

London to Tokyo, seen four ways

Drawn here at the parameters it defaults to, with every essay that calls it.
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 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.

It is drawn by route-figure with show: "route-projections" — one member of a family of 9 figures that share a generator, so the drawing above is what that generator returns when it is asked for this one and given nothing else.

14 essays call it. Every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about.

Where it is called

Changing this changes every one of these figures.

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. Paths and directions

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.

 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. Paths and directions

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.

 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 families

The aspect is a free choice

A projection's distortion pattern is fixed relative to its own axis, and where that axis points is entirely up to the cartographer. Rotating it is the cheapest available improvement and it is the one most often left unmade.

 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. Paths and directions

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.

 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. Paths and directions

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.

 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. Paths and directions

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.

 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. Paths and directions

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.

 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. Paths and directions

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.

 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. Paths and directions

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.

 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. What a machine does with it

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.

 What the drawn line costs, projection by projection. The ground length of the page-straight route from London to Tokyo, as a percentage above the shortest route. Two of these have names. On the gnomonic, centred on the route, the drawn line IS the shortest route, at -0.0000 per cent. On Mercator it is the rhumb, matching the rhumb's own length to 1 parts per million — which is why that projection exists. On the other eight it is a curve with no name and a cost between 0.0 and 19.6 per cent. Paths and directions

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.

 Two readings of the same triangle, and the band between them. The same three vertices, joined two ways: with straight lines in the plane the coordinates are stored in, and along the ground. Every dot is a point the two readings disagree about — inside on one and outside on the other. The band covers 29.5 per cent of the polygon, which is 4241 thousand square kilometres, and it is not an error in either reading: the file does not say which one it means. Densifying the stored boundary removes it, which is the only fix there is. Drawn in Equirectangular. What a machine does with it

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.

 The shortest route between two regions, and the pair it runs between. Europe and the conterminous United States, with the shortest route between them: 3,581 km, attained at one point on each boundary. The pair is not a corner, not a centre and not anything a reader could name — it is wherever two edges happen to come closest, which depends on the whole shape of both. The dashed route is the pair Gall–Peters makes look nearest: 4,085 km, which is 505 kilometres long, and its two ends sit 2135 kilometres from the true pair between them. Paths and directions

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.

 The plan, the crossing that was flown, and the one a right forecast would have given. A crossing of NaN km planned against a jet forecast to sit on the fortieth parallel, flown through a jet that is actually 6 degrees further south, and re-planned six times on the way. Committing to the plan costs 167.81 hours. Re-planning costs 165.84. A vehicle that had known where the jet was would have taken 163.21. So the wrong forecast is worth 4.60 hours and re-planning recovers 1.97 of them. Paths and directions

A crossing is a chain of decisions

Eleven rungs hand back a curve and stop, and nothing anybody flies is decided once. Re-planning is worth exactly nothing when the forecast turns out right — a sub-path of an optimal path is optimal, and the chain is the plan. When it turns out wrong it recovers 19 per cent of the cost at two decisions and 83 at eighteen, and never all of it.

The whole library