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

Nearest-neighbour — where it appears

Taking the value of the closest sample rather than combining several, which is the only resampling that returns values the data actually held. It is the only resampling that preserves a categorical raster, and it converges at no useful order because it is not a filter.

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

Which of eight places is nearest, decided on the ground and decided on the page. Every cell of the window shaded by which of eight places across Europe is nearest on the ground, with the cells the page's own answer would hand to a different site drawn in the failure colour. Plate carrée misassigns 13.67 per cent of the window's ground area — 3,058 thousand square kilometres. The misassigned cells are not scattered: they lie in bands along the boundaries, which is what a systematic error looks like and what a sampled test of a few query points is least likely to find.

Nearest of many is a partition

One reach question with one source is a disc. With several sources it is a division of the whole surface, every place belonging to whichever source is nearest — and computing that division in the plane the data is stored in hands away between 0.75 and 22.16 per cent of the ground, in unbroken strips up to 1,591 kilometres across.

paths · Reach 5 of 400 nearest-neighbour queries change answer in the plane. 40 sites and 400 queries over -20° to 40° east and 35° to 70° north, each query answered twice — once by geodesic distance and once by straight-line distance in the stored plane. They agree 98.8 per cent of the time, which is why the operation survives, and the 5 that differ are marked. The mechanism is not that the plane is wrong by a lot but that its scale factor varies: over this region it spans 139 per cent, and every disagreement is a contest closer than that — the worst margin measured is 6.4 per cent. The furthest a wrong answer is from the right one is 24 kilometres.

Nearest is a question about the metric

Asked in the plane the data is stored in, a nearest-neighbour query returns a different site for 5 of 400 queries over Europe on Web Mercator — and 103 of 400 on the plate carrée, with the wrong answer up to 309 kilometres further away. Every disagreement is a contest closer than the region's own scale spread, and over a city there are none.

applied · Dataset The ground two divisions disagree about. seven places across the world dividing the sphere twice under a steady westerly. Outbound, a place belongs to the site that can reach it soonest; inbound, to the site it can reach soonest. The pale tints are the outbound division where the two agree; the dark ground is where they do not, and it is 50.7% of the sphere — 258,530,666 km². Every site's own share of the world barely moves between the two divisions, by at most 3.8%. The two divisions assign nearly the same AMOUNT of ground to each site and assign completely different ground.

A partition under a directed cost has two versions

Dividing a surface among several sites is one question when the cost is a distance and two questions when it is not. Under a steady flow at 0.45 of a vehicle's own speed, the division by who can reach a place soonest and the division by which place can be reached soonest disagree about 50.7 per cent of the sphere — while no site's own share of the world moves by more than 3.87 points.

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

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.

applied · Dataset

Named alongside it

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

AreaMetricPartitionPurposeReachToleranceVerificationAnisotropyAsymmetryBoundaryCatchmentClosed form

All concepts