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

Coverage — where it appears

The fraction of a region a set of pieces actually reaches, which a criterion has to check before it may compare what it scored. It is also the cheapest self-check a geometric routine has: pieces of a sphere must sum to the sphere, by a route that shares no arithmetic with the answer.

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

Mercator swung through every tilt, over Chile and the tropics. The regional distortion of one projection as its axis is tilted from the normal aspect at 0° to the transverse at 90°, each curve divided by its own value in the normal aspect so the two regions can share an axis. Chile is best at a tilt of 90°, a factor of 183.5 better than north-up; the tropics is best at a tilt of 0°, which is north-up. Rotating the sphere costs nothing and changes none of the projection's own properties, which makes this the cheapest improvement available and the one most often left unmade.

Fitting the aspect to the region

Choosing a projection is a choice among a few dozen named things. Choosing its aspect is a choice among a continuum, it costs nothing, it changes none of the projection's own properties, and for a long thin country it is worth a factor of 183.

choosing · Choosing 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 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

Named alongside it

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

ToleranceAddressAggregationAnisotropyAreaAspectBufferCellContainmentConventionDiscrete global gridDiscretisation

All concepts