Concept

Aggregation — where it appears

Combining values that fall in the same cell into one number, which is a density only if the cells have equal areas. The correction is the areal factor of whatever projection the cells were defined in, and it is a different number in every row of a longitude–latitude grid.

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

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
How far each page reorders the shapes. The number of pairs of shapes whose order on the page differs from their order on the ground, out of 36, for ten projections. Four of them put a shape other than the geodesic disc at the top — Equirectangular, Lambert azimuthal equal-area, Robinson, Miller cylindrical — which means the shape that attains the isoperimetric bound on the sphere is not the most compact thing on those sheets. The projection with none is not the equal-area one; it is whichever one's stretching happens to leave this particular set of shapes alone.

The most compact shape depends on the paper

A geodesic disc attains the isoperimetric bound on a sphere — its score is one, exactly, at any radius. Score the same nine regions from their images on ten projections and four of them put something else on top, an oval and its own 45° rotation come out 4.7 per cent apart, and the projection that preserves the order is not the equal-area one.

paths · Reach
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
Equal area or steady shape, and not both. Four cell schemes plotted by how much their cells vary in area and how far from square the worst of them is. The bottom-left corner is the scheme that has both, and it is empty: the equal-area cube holds area to 1.003 and has the most elongated cells, the tangent-warped cube has the tightest shapes and lets area vary by 1.20, and the lon/lat scheme is off the scale on both. Neither axis can be driven to one while the other stays there.

A cell system trades area for shape

A grid can hold every cell to exactly the same area or hold every cell nearly square, and the measurement says it cannot do both: the equal-area cube's areas agree to a part in a thousand and its worst cell is 1.29 times as long as it is wide, while the tangent-warped cube holds shape to 1.19 and lets area vary by 20 per cent.

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
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
Three projections that run in a circle. Mercator beats Sinusoidal beats Eckert IV beats Mercator, each on a majority of the same seven criteria over the whole sphere. Every margin is four to three, the narrowest a majority of seven can be, and the criteria that decide each edge are different ones. There is no way to place these three in an order that agrees with all three comparisons, and the obstruction is not a measurement error: every number is exact to the precision the sampler reaches.

The ranking is not an order

The previous rung showed that a weighting can make almost any projection best. Remove the weights entirely, let each of the seven criteria vote once, and the answer is worse: over the whole sphere Mercator beats the sinusoidal, the sinusoidal beats Eckert IV, and Eckert IV beats Mercator — four such circles, every margin four to three, with a Condorcet winner sitting above them all.

wrong · Audit
The piece two schemes share, clipped rather than assumed. A cell of a gnomonic cube, whose four edges are great-circle arcs because a straight line on a gnomonic face is one, against a cell of a longitude–latitude grid, whose north and south edges are parallels and are not. Their overlap is neither a rectangle nor a spherical polygon of any standard kind, and it is 5965687 km² of the cube cell's 5965687 km² — 100.0 per cent. Computing it needs the arc of one boundary intersected with the plane of the other, which is three equations and two roots, and it is exact.

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
One quantity, one region, and the exponent left free. The scale departure of six projections over the world, aggregated as a p-norm, against p on a logarithmic axis. At p = 1 the best is Eckert IV; at p = 64 it is Winkel tripel. Nothing about the maps changed between the two ends of the axis — only how much of the region a bad point is allowed to spoil. Drawn in no projection: the axes are an exponent and a score.

The average was a choice of norm

Ten projections, one region, one measured quantity, and the only free decision left is how to turn a field into a number. Over the world's scale departure the ordering at the mean and the ordering at the worst case have a rank correlation of −0.04, all ten maps change position, and the exponent that produced each answer is stated nowhere.

wrong · Audit
Two regions, three answers. Britain and New Zealand, 166° apart, with the pole of the best oblique conic under each of three objectives. Pooling the samples and taking an area-weighted score puts the pole in one place; refusing to let either region be worse than the other puts it somewhere else. The regions are drawn on Mollweide so that equal ground areas are equal page areas.

The pooled score abandons a region

Fifteen rungs optimise for one region. An atlas is several, and pooling their samples into one area-weighted score is what everybody does — which on Britain and New Zealand serves Britain 1.2 times worse than it could be served alone and New Zealand 125 times worse. The worst-case objective makes them equal at 33 and 59, and the cost of sharing rises with separation from 1.4 to 59.

choosing · Choosing
What simplifying a boundary does to the number stored beside it. One region, simplified at five tolerances, with the error in the two quantities a consumer computes from the pair. If the density was stored, the total it implies moves by exactly the area's error — -1.55 per cent at the loosest tolerance. If the total was stored, the density it implies moves the other way by the same amount. Nothing in the file says which of the two was measured and which is being derived, and the simplification is normally done by a tool that never opens the attribute table.

The attribute is a claim about the geometry

Fourteen essays price what a stored coordinate means and not one asks what the number stored beside it means. A rate is a quantity divided by an area, the area belongs to the geometry, and no format records which area — so a simplification that moves the outline by nothing visible moves the implied total by 1.55 per cent, an unweighted average of densities is 4.09 per cent out, and a choropleth gives a polar square kilometre fifteen times the ink of an equatorial one.

applied · Dataset
Two source geometries of 96 cells each, rebinned to the same three targets. Both curves start from a source of 96 cells and rebin to targets of 32, 128, 512 cells, so the count ratio is identical along them and the only difference is the shape of the source cells: gnomonic squares on a cube against rectangles in longitude and latitude. The ratio dominates — both curves fall by more than half across the range — and the shapes still separate by 25 points at the middle target. The cube loses less, because its cells are all much the same size and the lon/lat source's collapse towards the poles.

The same number of cells, in two shapes

Moving a field between two cell schemes loses 18 per cent of it per cell in one geometry and 39 in another, and the earlier measurement could not say whether that was the shape of the cells or the ratio of their sizes, because changing the schemes changed both. Holding the counts settles it: the count ratio decides most of the loss, and the shape is still worth a quarter of the field.

applied · Cells
What a rebinning loses depends on where the target's edges are. Two grids of fixed counts, fixed shapes and fixed resolution, with the target slid across the source from perfect alignment to a full cell. Nothing about either grid changes except where its boundaries fall. The loss runs from 27.5 per cent at zero to 56.3 at half a cell — a factor of 2.04 — and the longitude-only curve returns to its starting value at a full cell to six decimal places, which is the periodicity check. A cell boundary that coincides with a target boundary loses nothing, and a grid comparison that does not say where its boundaries are has left that out.

When the edges do not line up

Rung eight held the cell counts equal so that shape could be compared without the count ratio drowning it, and recorded a doubt: a longitude–latitude source shares its boundaries with a longitude–latitude target wherever their counts share a factor. The mechanism is real and worth a factor of two. It was not what the published number was made of.

applied · Cells
The same 2-pixel road at three latitudes, zoom 5. The dark bar is the mark as drawn — 2 pixels, identical in all three panels, because that is what the stylesheet says. The pale band behind it is the ground that mark covers, drawn to one common ground scale: 9.78 kilometres at the equator, 6.92 at 45° and 1.70 at 80°. The reader sees the dark bar and is being told about the pale one.

The road is drawn two pixels wide

Seven rungs measure what a screen map does to position. Nothing on a map is a point: every mark has a width, the width is chosen in pixels, and a two-pixel road covers 9.78 kilometres of ground at the equator and 1.70 at 80° north. That is a generalisation applied at a strength varying by a factor of six across one sheet, by a stylesheet with no latitude in it.

applied · Screen
Twenty-four versions of one shape, and not one of them gains area. The same closed boundary rotated twenty-four times and simplified at the same tolerance. If the area error were noise the values would straddle zero and their mean would fall towards it; they do not. Every one is negative, the mean is -0.4644 per cent, and the mean is 71 standard errors from zero. A bias of that size cannot be removed by averaging over more boundaries, which is the only defence anybody has against a rounding error.

A thousand features are wrong in the same direction

The area a simplification costs is unpredictable in sign for one feature. Over a population it is not: twenty-four presentations of one shape all lose area, the mean is seventy standard errors below zero, and no amount of aggregation removes it.

applied · Generalise

The answer depends on the cells it was counted in

Nine essays price the cell as a shape. The number reported out of it is priced nowhere: sliding a grid without changing its resolution moves the largest reported value by 12.6 per cent, which is more than halving the resolution costs.

applied · Cells

A cell's children do not fit inside it

Ten rungs price one cell system at one resolution, and every one of them is used hierarchically. A hexagonal hierarchy does not nest: at the aperture-seven scheme the discrete global grids use, one fourteenth of a parent is covered by no child of its own, exactly, and each of the six ring children is eleven twelfths inside.

applied · Cells

The class breaks were computed on the page

The three rungs below price what a reader does with a finished map. A classifier is software, it runs on the geometry it has, and the geometry it has is projected: a five-class quantile classification of one stated field puts half of the three hundred and eighty-four regions in a different colour on Mercator, and 87.5 per cent of them at nine classes.

distortion · Thematic

One number changed and the whole map moved

Raise one bump's weight in a density specification, leave every other number identical, and solve again. London's own value is what changed; London moves 0.054 and Delhi moves 0.226 — four times as far, with its own number untouched. The largest displacement anywhere is thirty degrees from the change, and the antipodal band still moves a fifth of the peak.

distortion · Cartogram

The area is unbiased and the perimeter is not

A boundary measured from noisy vertices comes out long, always, by σ²/d on every leg. The area enclosed by the same vertices comes out exactly right, because a shoelace is bilinear and the cross terms vanish. So densifying a boundary makes its area five times more precise and its perimeter three thousand times more wrong, and every compactness score computed from it falls short.

distortion · Precision

Named alongside it

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

Discrete global gridCellEqual-areaToleranceVerificationAnisotropyClosed formPurposeTrade-offAreaCell systemGeneralisation

All concepts