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

Locality — where it appears

The property that an operation touches only its own neighbourhood, which is what makes tiles cacheable and centroids of small regions safe. It fails at a tile boundary, where the geometry inside one tile is generalised without the geometry outside it, and the two answers do not rejoin.

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

A feature across nine tiles at zoom 4, and the nine labels it gets. A rectangle from -10° to 30° east and 36° to 62° north, drawn in the projected plane with the tile boundaries over it. A renderer that draws each tile from the geometry inside that tile puts the label at the centroid of the piece, marked hollow; the whole feature's centroid is the filled mark. The furthest piece's label is 1863 kilometres from it. The pieces' areas sum to the whole to 2.2e-16 of a relative part, so the clipping is exact and the displacement is the operation rather than an error in it.

A tile is drawn without its neighbours

Independence is what makes the scheme scale: one request touches one square of the world. It also means a feature crossing nine tiles is nine features, each labelled at its own centroid — up to 1,863 kilometres from the whole one — and the displacement is bounded by the size of the feature rather than the size of a tile, so it grows as the reader zooms out.

applied · Screen Three surfaces with the same curvature, one of which is a sphere. Every one of these is a surface of revolution whose Gaussian curvature is 1 at every point, built by solving r″ + r = 0 for the meridian rather than by writing a shape down. The spindle closes to a point with an angle deficit, the sphere closes smoothly, and the bulge does not close at all — it ends in two circular edges. A surveyor confined to a patch of any of them, measuring angles and distances, cannot tell which one it is.

Two surfaces with the same curvature

The ladder's base says curvature is the obstruction to a faithful map. It has never asked whether curvature is the whole obstruction — and it is, locally: there is a whole family of surfaces with the unit sphere's curvature at every point, none of them a sphere, and a geodesic circle drawn on one agrees with the same circle on another to one part in 10¹⁴.

impossibility · Curvature Where the middle of a 20° × 20° region is, in five planes. The region is drawn in longitude and latitude — which is itself a projection, and one of the ones being compared. Each filled mark is the shoelace centroid computed in one projected plane and inverted back to the ground; the hollow mark is the centre of area on the sphere, by integration. They spread over 273 kilometres. The equal-area member is 66 kilometres out, because a centroid is a first moment and preserving area says nothing about where the area sits.

A centroid belongs to a plane

Every renderer labels a region at its centroid, and every centroid is a shoelace over coordinates as stored — which is a statement about the plane they are in. Six planes put the middle of one 20° × 20° region up to 273 kilometres apart, the equal-area member is 66 kilometres out, and the disagreement falls as the square of the region's size.

applied · Dataset 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.

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 Two nets of the same solid, cut to the same length. Every net of a Platonic solid severs exactly the same number of edges, all of the same length, so the total length of the cut is a constant and cannot choose between them. Each line joins the two places a severed edge ends up. Left: the net that keeps them closest, 11.30 edge lengths in total. Right: the net that puts them furthest apart, 17.97 — a factor of 1.59 for the same amount of cutting.

The net that loses the fewest neighbours

Every one of the cube's 384 nets cuts exactly seven edges of exactly the same length, so the quantity this collection has been pricing cutting by is a constant that cannot choose between them. Measured on the reader's side — how far apart a net puts two places that touch on the globe — the best net scores 11.30 and the worst 17.97, for identical cutting.

families · Polyhedral The same address length, a tenth of the area. Every cell of a lon/lat quadtree at level 4 carries an identifier of the same length. The heavy curve is each cell's area as a fraction of the largest, against its latitude: a polar cell is 10.2 times smaller than an equatorial one. The light curve is the inverse of the cell's aspect ratio, which falls from 1.00 near the equator to 0.10 at the top — the cells stop being anything like square long before they stop being usable.

An address is an area

A cell identifier does not name a place, it names a region — so its precision is an area rather than a length. On the obvious lon/lat scheme that area varies by a factor of 10 at level 4 and 163 at level 8, and the factor doubles with every level: the same identifier length means less ground the further north it is used.

applied · Cells A hexagonal tiling of the sphere, and its pentagons. 362 cells — 350 hexagons and 12 pentagons, the pentagons marked — drawn on Orthographic. The twelve are not a defect of the construction and cannot be removed by subdividing further: Euler's formula requires exactly twelve however many hexagons there are. Each pentagon here has 0.52 times the area of an average hexagon, so a count aggregated over these cells has twelve entries that mean something different from all the others.

Hexagons cannot tile the sphere

Hexagons are the best cell shape a plane offers and the sphere will not take them. Euler's formula forces exactly twelve pentagons into any such tiling — twelve at 42 cells and twelve at 642, while the hexagon count rises twenty-one-fold — and each of the twelve is measurably smaller than the hexagons around it.

applied · Cells A 6° query against a cube scheme, and the cells it fetches. The cells of a tangent-warped cube scheme at level 5, with the 29 cells a query of 6° radius touches shaded. The disc's own area is 16.84 cells; the count is 29, because every cell the disc's boundary crosses is fetched as well as every cell inside it. In Hilbert order those cells form six contiguous ranges of identifiers, which is six range scans, and the span from the lowest to the highest covers 91 cells against the 29 wanted. Drawn in Mollweide, with the mesh shown only near the query.

A query is a disc, and a disc is not a cell

Everything a cell system does is an address lookup except the one question anybody actually asks it: find everything within five kilometres of here. That is a disc, and the number of cells it fetches is not its area divided by a cell's — at the radii a query is really made at, it is three to seventeen times that.

applied · Cells Steepest descent on Lambert cylindrical, computed on the ground and on the page. Fifteen routes, each started at the same place twice. The solid line follows the true direction of steepest descent on the sphere; the dashed line follows the direction read off the page at every step, which is what an analysis of a projected grid does. Both take the same length of step on the ground, so the only difference between them is the direction. They part by up to 1517.8 kilometres, against a bearing error of 45.6°. The faint lines are contours of the field, which is seven caps at stated centres and widths.

Water runs downhill on the ground, not on the page

A drainage network is the set of steepest-descent trajectories of a field, so it is built entirely out of directions. A conformal map preserves those directions exactly and therefore preserves the whole network; an equal-area map does not, and sends a route up to 892 kilometres away from where the water actually goes.

distortion · Gradient Hilbert order on one face, as a curve. The order in which Hilbert numbering visits the 64 cells of one cube face at level 3. The line never leaves a cell without entering one that shares an edge with it — that is what makes it a space-filling curve, and it is why two cells with nearby identifiers are usually near each other on the ground.

The address is a curve through the sphere

A database does not fetch a set of cells, it reads ranges of identifiers — so the cost of a query is how many runs its cells form, not how many cells it needs. Hilbert order wins that measurement and loses the one usually quoted for it: its neighbouring cells are further apart in identifier than row-major's, on average and at worst.

applied · Cells One field, one round trip between two cell schemes. Left: a stated field binned into an equal-angle grid of 36 by 18 cells. Right: the same field after being rebinned into an equal-area grid of 30 by 15 offset by six degrees of longitude, and rebinned back. Every step is exact area-weighted averaging, the total is preserved to 2 × 10⁻¹⁶, and the root-mean-square difference between the two pictures is 0.144 on a field whose own standard deviation is 0.370.

The same data on two grids

Five essays have addressed, queried and ordered cells within one scheme and nobody has moved a number between two. Doing it exactly — area-weighted, both directions — preserves the total to 2 × 10⁻¹⁶ and loses 39 per cent of the field's own standard deviation in a single round trip; six round trips leave 23 per cent of its variance. The quantity that would reveal the damage is the one that never moves.

applied · Cells 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.

AggregationCellDiscrete global gridToleranceAddressVerificationAnisotropyEqual-areaHierarchyQuadratic lawThematic mappingTile pyramid

All concepts