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

Constraint — where it appears

A condition a route or a solution must satisfy, which turns a shortest-path problem into one whose answer rides the boundary for part of its length. A route that must avoid an obstacle rides its boundary for part of its length, and the detour is a tangent, an arc and a tangent rather than a curve.

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

Angular deformation against latitude, four projections. The same quantity for mercator, gallPeters, winkelTripel, robinson, from the equator to 80°. A conformal projection sits flat on zero in the first of these plots and runs away in the second; an equal-area projection does the reverse. Nothing is flat in both.

Every projection minimises something

A projection is the solution to an optimisation problem, and naming the objective explains more than naming the family. Some objectives are exact constraints, some are least-squares fits, and one is a table of numbers a man adjusted until it looked right.

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 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 A map for pointing, not for locating. Craig's retroazimuthal projection, centred on Mecca. The straight line from any point to the centre makes an angle with the map's vertical equal to the true initial bearing from that place to the centre — checked here at 169 points, worst disagreement 5.7e-14 degrees. The bearings printed beside each line are computed on the sphere with no projection in them.

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 The minimum-distortion conformal map of an elongated region, 30° by 10°. The conformal projection of an elongated region, 30° by 10° whose scale is constant on the boundary, which is Chebyshev's criterion, obtained by fitting eight terms of a series rather than by choosing a named projection. The scale factor runs from 0.98640 to 1.00000, a spread of 1.01379; on the boundary itself the largest departure from constancy is 2.13e-7 in the log, which is what the fit achieved and not what it was told. Each dot is an interior sample shaded by its own departure from the boundary's scale.

Solving for the map instead of choosing it

Chebyshev's criterion has sat on this site since its second phase with one case it could be applied to: the spherical cap, whose answer is the stereographic projection. For any other region the site stated the criterion and stopped. It is a linear least-squares fit, and the fitted map beats every named projection over the region it was fitted to.

choosing · Condition An equal-area map nobody would publish. Mollweide, with a row-dependent horizontal displacement applied to the page afterwards. That plane map has Jacobian determinant 1 everywhere, so every areal scale factor is untouched: the worst departure from 1 anywhere sampled here is 6.0e-12, which is the arithmetic's own floor. It satisfies the equal-area condition exactly and completely, and it is a ruin. The angular deformation at 30°E 20°N has gone from 11.0° to 60.5°.

Every equal-area map is every other one

Take Mollweide and slide every row of the page sideways by an amount that depends on the row. The result satisfies the equal-area condition to 6 × 10⁻¹², exactly as well as Mollweide does, and it is a ruin — the angular deformation at one ordinary point has gone from 11° to 60°. Equal-area is one equation, and one equation leaves a whole function free.

choosing · Condition The shortest route, and the shortest route a vehicle can fly. A leg of 60 kilometres for a vehicle whose minimum turning radius is 5, arriving on a heading 120° off the line and required to leave on one -60° off it. The straight line is the geodesic; the curve is the shortest curvature-bounded path, which is Dubins's RSR — a turn, a straight, a turn — at 67.29 kilometres against 60. The second curve is the runner-up word, drawn to show that the choice between them is a real one rather than a formality.

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 Which scale fields a map could have, and which are only wishes. Liouville's equation — the Laplacian of log k equals 1/k² on the page — is the whole condition for a conformal map of a unit sphere to have a stated scale factor. The first two rows are the scale fields of real projections and they satisfy it to the differencing step. The rest are requests a designer might write, and every one of them fails — except one, which turns out to be a projection somebody already found. Asking for no distortion anywhere fails by exactly one, which is the curvature of the sphere.

Not every distortion can be asked for

Six essays have written projections as conditions and asked how much freedom a condition leaves. The reverse question has never been put: a cartographer knows what distortion they want, so can they ask for it? For a conformal map the answer is a single equation, it is the Theorema Egregium in disguise, and asking for no distortion anywhere fails it by exactly the curvature of the sphere.

choosing · Condition Five stations, ten distances, three spare. A braced quadrilateral with a centre point. Every distance between the corners and every distance to the centre is observed, 10 in all, each with a standard deviation of 8 mm. Holding one station and one bearing leaves 8 unknown coordinates, so the network has three degrees of freedom: three independent statements the observations make that could be contradicted. Everything the adjustment can tell anybody about the quality of the work comes out of those three.

A coordinate is the output of a solve

Six essays measure a tape, close a traverse, spread a misclosure and reduce a chain. The coordinate that comes out of the far end is the solution of a least-squares problem, and the problem has a decision in it that is not a measurement: what to hold fixed. Change it and every coordinate moves by centimetres while not one residual moves at all.

practice · Reduction The part of a request no conformal map can supply — scale falling with distance from the centre. The difference between the requested scale field and the nearest achievable one, over the patch, with the sign shown by colour. The RMS is 1.81e-1 in the logarithm of the scale and the worst single point is 4.91e-1. This is not an error: it is the part of the request that no conformal map of any kind can grant, and its SHAPE is the answer — it says where the request was impossible, which a single number cannot.

The nearest map to an impossible request

Rung seven found that not every distortion can be asked for. It never asked what happens when one is asked for anyway — and the answer has a shape: the achievable fields are the solutions of an elliptic equation, a request is a point off that set, and the nearest point leaves a residual whose floor is the curvature rather than the size of the ask.

choosing · Condition The share of its distances a flat picture can hold. A picture of n places on a plane has 2n coordinates and is unchanged by two translations and a rotation, so 2n − 3 numbers in it are genuinely free; each distance held exactly is one equation. So at most 2n − 3 of the n(n−1)/2 distances can be right, whatever the places are and however hard the map maker tries. The share falls as 4/n: five of six for four places, thirteen of twenty-eight for eight, and 197 of 4,950 — 4.0% — for a hundred. The dashed curve is 4/n, which the count approaches from below and never crosses.

Five distances of six, and never more

A flat picture of n places has 2n − 3 free numbers and n(n−1)/2 distances, so it can be exactly right about 2n − 3 of them and no more — five of six for four places, twenty-nine of a hundred and twenty for sixteen, and 3.98 per cent for a hundred. The bound is reached by a construction with no fitting in it, and an azimuthal equidistant map spends only n − 1.

impossibility · Embedding The page's curvature is not a free parameter. The same trilateration, carried out on a sphere of stated radius instead of on a plane, with the error of the distances the construction decides rather than holds. At the radius the distances were measured on it is 5.1e-15 — exact, by construction, which is the refusal this figure exists to make. Two per cent either side of it the worst decided distance is already out by around 10%. Below 90 per cent of the Earth's radius the construction cannot be completed at all: two circles that must cross do not, and the page is simply too small to hold the places. The flat sheet is the right-hand limit, at 152%.

The escape is not a dimension

Four places that will not lie in a plane surely lie in a space — and they do not. The double-centred matrix of their great-circle distances has a negative eigenvalue, so no Euclidean space of any dimension holds them, and buying a third dimension improves the picture by nothing whatever, to fifteen decimal places. What does work is a page with curvature, and the curvature is pinned to within two per cent.

impossibility · Embedding The same patch, pinned six ways. Two vertices have to be held or the conformal energy has a similarity's worth of null space. Which two turns out to decide two of the three numbers reported. The median angular deformation is the same to 8 per cent across all six — that is the map. The areal spread runs from 2.68 to 7.44, so the 3.07 reported for this body was a statement about its corners. And pinning two adjacent vertices, which fixes the similarity through a very short lever, ruins the worst point without touching the median: a badly conditioned constraint pays for its scale in one corner.

The map depends on where it was cut

The previous rung solved the discrete conformal equations on a triangulated body and reported an areal spread of 3.07, then recorded that the number might belong to the patch, the boundary and the two pinned vertices rather than to the surface. It belongs to the pins: hold a different pair and it runs from 2.68 to 7.44, while the typical angular deformation does not move at all.

datums · Bodies The test the ladder asked for, and it refutes the conjecture. How much better the best asymmetric projection is than the best symmetric one, under weightings of four different symmetries, with every symmetric map allowed to re-aim its axis at twelve candidate poles. The conjecture rung eight recorded was that the seven earn their place by PLACING distortion where a symmetric map cannot, so their advantage should collapse under a criterion with no place preference. It does the opposite: the advantage is largest at 1.343 under the uniform weighting and smallest at 1.144 under a band, with the fully asymmetric concentration at 1.204 in between. The winner is named on each row and the map it beat is Equirectangular throughout. The seven are simply better maps.

The maps with no family are simply better

Rung eight found seven projections with no continuous symmetry and noticed they are almost exactly the set anybody would choose for a world map, then offered a conjecture with a test attached: their advantage should collapse under a criterion that does not care where anything is. Run, it does the opposite — 1.343 times under a uniform weighting and 1.204 under a concentration. The conjecture is refuted.

families · Families

Named alongside it

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

ConformalityClosed formConditionOptimisationDegrees of freedomGreat circleLeast-squaresVerificationBoundary-valueDifferential equationObjective functionPurpose

All concepts