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

Discretisation — where it appears

Replacing a continuous problem by a finite one — a mesh, a grid, a difference — so that it can be solved. Its errors are separate from the answer's and can be larger: a solve's cost and conditioning belong to the discretisation rather than to the geometry it approximates.

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

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 The set a reach map shows, drawn from eight bearings. A geodesic disc of 4,000 km and the polygon a fan of eight bearings draws round it, on an equal-area azimuthal page centred on the disc so that the shaded ground is proportional to the ground it stands for. Every vertex of the polygon is on the true boundary and every edge between two of them is a chord, so the drawn set is inside the true one — always, at every count, for any convex reach set. The area it misses is 7.53% of 48,635,855 km², and it is not an error that care removes. It is what a finite fan is.

Every reach set ever drawn is too small

An isochrone is drawn by walking out along a finite number of bearings and joining the points, so its vertices are on the true boundary and its edges are chords — which puts the drawn set inside the true one, always, at every count, for any convex reach set. The deficit falls as the square of the count, and a spherical cap loses less than a circle by exactly cos t (1 + cos t)/2.

paths · Reach 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.

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.

paths · Paths The piece count rises and falls. The number of connected pieces of the near-optimal aspect set for robinson over japan, swept finely through the threshold rather than sampled once below it. It is one piece at a wide threshold, reaches 23 at 1.256, and returns to one as the set shrinks onto the single best aspect. The set first disconnects at 2.244, which is above the peak: the pieces keep multiplying after the first break. This is the sweep the rung below could not afford and it costs one grid, because every threshold reads the same 4992 evaluations.

The threshold is not a percolation

The rung below found the near-optimal aspect set breaking into twelve pieces rather than two, called the transition a percolation, and recorded that it had not measured the exponent. Swept finely, the piece count rises from one to twenty-three and falls back to one — and refining the grid by a factor of fifteen does not move the peak, while an uncorrelated field on the same lattice grows by a factor of twelve.

choosing · Choosing Where the condition holds, and where it was asked to. The boundary scale of a fit collocated at 20 points, drawn all the way round the boundary. The marked points are the ones the condition was imposed at, and the curve passes very near zero at every one of them; between them it does not. The largest departure on the samples is 3.92e-5 and the largest anywhere is 3.27e-4, and the second is the one the map has.

A condition imposed at points is not a condition

Nine rungs state a condition and solve it, and every solve imposes the condition at a finite set of samples because that is what a linear system is. With barely more equations than unknowns the residual the solver reports is 8.3 times too good — and refining the collocation twentyfold does not improve the map at all, it only makes the report honest.

choosing · Condition The solve's cost is a U in the shape; the curvature is not. Solid: how many conjugate-gradient steps the conformal solve needs, against the window's aspect ratio, at constant surface area. It has a minimum at the square window — 174 steps — and rises to 265 and 275 at the two extremes, which are elongated by the same factor in opposite directions. Dashed: the total Gaussian curvature the window encloses, on its own scale, which falls from 0.311 to -0.012 across the same sweep and is least at one end of it. The cost has its minimum where the window is square and the curvature has its minimum somewhere else, so whatever is making the solve expensive is not what is making the map spread.

A long window and a square one

Rung nine held the patch's area and found that where the cut goes still changes the map by a third, with the curvature it encloses predicting the change at r = 0.969. It recorded that it had held area and curvature and not shape. Sweeping the shape at constant area separates two things that had looked like one: the map is curvature and the cost is shape.

datums · Bodies Two features, one shared boundary, simplified apart. Two neighbouring areas whose common boundary is a curve with structure at every scale — a river or a ridge, in effect — each stored with its own copy of that boundary and each simplified on its own at a tolerance of 0.01. The faint outlines are the originals and the solid ones what came back. The two copies of the shared boundary were within 0.01 of each other before the simplification and are not afterwards: 144 probe cells of 40000 now lie inside both features and 0 inside neither.

A boundary that two features share

Three rungs simplify one curve and price what a tolerance covers. Almost no boundary in a real dataset belongs to one feature: a county's edge is the next county's edge, it is stored twice, and it is simplified twice. What opens between the two answers is a region belonging to both features or to neither, and its area is not bounded by the tolerance.

applied · Generalise The straight line between two correct maps passes through an incorrect one. Both ends of this sequence are exact cartograms of four cities: the triangular, x first construction at s = 0 and the triangular, y first at s = 1, each meeting the density to arithmetic noise. The panels between them are the straight-line blend of the two, which is what an animation between two maps computes. The cells drawn solid have turned inside out — their signed area is negative, so the map has folded over itself there and two places on the sphere are drawn at one place on the page.

A map that meets its target can fold

The flow a diffusion cartogram integrates is a diffeomorphism at every instant and cannot fold. Every discretisation of it can, and the point at which one does is a root of a quadratic — written down rather than searched for.

distortion · Cartogram The same labels, placed once and placed per tile. 140 stated label boxes on a 1024-pixel page cut into 256-pixel tiles. The pale boxes are placed the same way by both rules. The dark ones are placed by the tiled renderer and suppressed by the global one — labels that should have lost a collision with something in the next tile and did not, because the tile that drew them could not see it. nine of them, against 104 labels the global rule keeps.

A label belongs to no tile

Nine rungs price the tile as a piece of geometry. A label is not geometry — it is a page object placed by collision against other page objects, and collision is a global relation while a tile is rendered alone. Cut a page into tiles and 10.3 per cent of the labels are placed differently; the buffer that closes the gap is half a tile at moderate density and a whole one when it is crowded.

applied · Screen

Named alongside it

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

VerificationConvergenceToleranceAreaAreal factorConformalityEstimatorShortest pathAnisotropyAspectAspect searchBasin

All concepts