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

four planes a dataset might be stored in, scored on three operations

Drawn here at the parameters it defaults to, with every essay that calls it.
four planes a dataset might be stored in, scored on three operations. Each candidate measured over -10° to 30° east and 35° to 60° north: the worst areal error, the worst angular deformation, and the spread of the scale factor, which are what an area query, a shape and a distance respectively depend on. The best plane for areas is Gall–Peters, for shapes Web Mercator, and for distances Lambert azimuthal equal-area — three different answers, and no fourth candidate would collapse them, because a projection exact in two of these columns has a = b = 1 everywhere and is the isometry Gauss's theorem forbids. area of a polygon costs 3.06× too large in the wrong plane; drawing a line between two points costs 194 km from the ground it claims.

Each candidate measured over -10° to 30° east and 35° to 60° north: the worst areal error, the worst angular deformation, and the spread of the scale factor, which are what an area query, a shape and a distance respectively depend on. The best plane for areas is Gall–Peters, for shapes Web Mercator, and for distances Lambert azimuthal equal-area — three different answers, and no fourth candidate would collapse them, because a projection exact in two of these columns has a = b = 1 everywhere and is the isometry Gauss's theorem forbids. area of a polygon costs 3.06× too large in the wrong plane; drawing a line between two points costs 194 km from the ground it claims.

It is drawn by operation-figure with show: "operation-table" — one member of a family of 14 figures that share a generator, so the drawing above is what that generator returns when it is asked for this one and given nothing else.

4 essays call it. Every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about.

Where it is called

Changing this changes every one of these figures.

The area of one 20° × 10° cell at 50–60° north, seven ways. The cell has an exact area — R²Δλ(sin φ₂ − sin φ₁), 1,416,580 square kilometres — so every other row is a measurement of the method rather than of the ground. The equal-area projection returns it to 1.000000 and the spherical polygon formula to 1.000000, which is three routes agreeing — and the same cell integrated on the ELLIPSOID comes out 0.45 per cent away from all three, because the sphere is a model. Taking the shoelace in Mercator gives 3.06 times too much, and treating degrees as a length gives 1.75 times — about sec φ at the cell's middle, which is where that error comes from. What a machine does with it

Computing an area needs a surface

A shoelace over a ring of coordinates returns a number whatever the coordinates are. For one twenty-by-ten-degree cell it returns 1.75 times the true area in degrees, 3.06 in a conformal plane, and exactly the closed form in an equal-area one — and the closed form itself is 0.45 per cent out, because the sphere is a model too.

 five planes a dataset might be stored in, scored on three operations. Each candidate measured over -10° to 30° east and 35° to 60° north: the worst areal error, the worst angular deformation, and the spread of the scale factor, which are what an area query, a shape and a distance respectively depend on. The best plane for areas is Gall–Peters, for shapes Lambert conformal conic, and for distances Lambert conformal conic — three different answers, and no fourth candidate would collapse them, because a projection exact in two of these columns has a = b = 1 everywhere and is the isometry Gauss's theorem forbids. area of a polygon costs 3.06× too large in the wrong plane; drawing a line between two points costs 194 km from the ground it claims. What a machine does with it

The operation decides the coordinate system

Five candidate planes over one region, scored on the three things a spatial operation depends on. The conformal conic wins shape and distance and is 11.7 per cent out on area; the equal-area member is exact on area and 38.9° out on shape. No candidate is exact in two columns, and no candidate ever will be, because one that was would be an isometry.

 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. What a machine does with it

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.

 The same kernels, across an edge. Each kernel measured over the same five rasters as the smooth measurement, on a field that carries a step across a tilted line instead of a smooth function. The solid lines are the edge and the faint ones the smooth field. The orders on the smooth field are nearest 1.00, bilinear 1.98, cubic 2.93; across the edge they are nearest 0.78, bilinear 0.58, cubic 0.60 — within a factor of 1.33 of one another, and the fastest of them belongs to nearest-neighbour, which does no interpolating at all. The ranking a smooth field establishes does not survive a discontinuity, and a real raster is mostly edges. What a machine does with it

An edge has no order of convergence

On a smooth field the three resampling kernels converge at orders 1, 2 and 3 and the choice is obvious. Across a discontinuity they converge at 0.78, 0.58 and 0.60 — within a factor of 1.4 of each other, in an order that puts nearest-neighbour first, and a real raster is mostly edges.

The whole library