Choosing — the ladder
-
Every projection minimises something
A projection is the solution to an optimisation problem, and naming the objective explains more than naming the family. Some objectives are exact constraints, some are least-squares fits, and one is a table of numbers a man adjusted until it looked right.
-
Which projection is best
An incomplete question, and the incompleteness is the answer. Every projection preserves something and destroys something else, so the comparison worth making is between a projection and a purpose, not between two projections.
-
Compromise projections
A projection that preserves nothing exactly can distort everything less than one that preserves something exactly. For a general-purpose world map that is the right trade, and it is why the two most widely used ones today have no exact property at all.
-
Chebyshev's criterion
The only optimality theorem in the subject. Among all conformal projections of a region, the one with least scale variation is the one whose scale factor is constant on the boundary — a criterion with a proof, a unique answer, and a test the site can run.
-
Giving up continuity
Cutting a map into lobes really does reduce the distortion, by a factor that can be measured. What is paid is that the map stops being one surface — and the size of the tear is the number that pictures of interrupted maps never carry.
-
The average of two projections
The Winkel tripel is literally the arithmetic mean of two other projections, and this site's implementation of it agrees with that mean to the last bit. Averaging beats both ingredients by 26 per cent — and it preserves conformality exactly, destroys equal-area completely, and can turn eighteen per cent of the world inside out without either distortion measure saying so.
-
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 for a line, not a region
Every criterion in this subject integrates over an area. A pipeline, a railway or a coastal survey is a curve, and the projection an area criterion picks for it is not the one it should have — measurably, by a factor of five thousand.
-
How many sheets an atlas needs
A tolerance on the scale error inverts, through Chebyshev's bound, into a sheet radius — and a covering problem turns the radius into a count. One part in a thousand costs 1,210 sheets of 403 kilometres radius, the count goes as the reciprocal of the tolerance exactly, and the projection multiplies it by anything from one to fifty-six.
-
The aspect has three numbers, not one
The site's aspect search has swung the projection's axis through one plane for a long time, and recorded that a region whose long axis runs diagonally has its optimum somewhere that plane never reaches. Searching the whole sphere of pole positions finds 2.6 times more improvement over Japan and 3.4 over the conterminous United States.
-
The sphere is not the plane at small counts
The site's atlas arithmetic multiplies an ideal sheet count by 2π/√27, the thinnest covering density of the plane. At the four counts whose optimal covering of the sphere is a theorem the plane's number is 21 per cent high at two caps and 9, 5 and 2 per cent low at four, six and twelve — wrong in both directions, and the direction changes with the count.
-
The third parameter, run
An aspect has three numbers and this site has been searching two of them, with a note admitting it. Searching all three is worth up to 2.1 times — and the obvious way to do it, starting from the two-parameter answer and letting the third move, finds a fraction of that or nothing at all.
-
The landscape the search walks on
The three-parameter aspect search was run and its answer recorded with a note admitting nothing proved it global. Mapping the objective finds 26 to 34 local minima for every projection and region tried, a downhill walk from a random start reaching the best of them 6 to 35 per cent of the time — and one seed from the coarse grid the search already uses reaching it in all four cases. The score is reproducible to two per cent across a sevenfold refinement; the pole it names moves 60 degrees.
-
Report the map, not the parameters
The previous rung found the aspect search returning the same score to 2.3 per cent from poles sixty degrees of latitude apart, and recorded that as a shortfall: the answer was not reproducible. The shortfall assumed the disagreeing triples make disagreeing maps. They do not — the three answers agree on the distortion field to a quarter of the deformation the map already has.
-
The shape of the valley
An aspect search returns three numbers, two searches return triples that differ by a hemisphere, and the maps they produce agree. One cause is an exact degeneracy and the rest was called a valley and left unmeasured. Sampled densely, it is neither a valley nor a basin: a connected sheet spanning 170° of pole that fractures into fourteen pieces once the threshold tightens.
-
Where the valley breaks in two
The previous rung found a near-optimal set that is one connected sheet at a loose threshold and fourteen basins at a tight one, and explained the transition without testing it. The explanation is a prediction about region size and projection sharpness: swept over both, the threshold falls from 2.13 to 0.27 as a region grows from 6° to 30°, three projections lie on nearly one curve, and a fourth declines to join for a reason worth having.
-
The height of the pass between two basins
The previous rung recorded a shortfall: the fracture threshold falls as the −1.33 power where the argument predicts −1, and the difference was supposed to be the height of the pass. It is not. Measuring the pass directly gives −1.60, which is further from the prediction, and the two basins turn out to be exact symmetric copies with nothing to decompose.
-
The basins have widths as well as depths
The previous rung measured the height of the pass and recorded a shortfall: shape means widths too. Measured, the basin has three of them — 32°, 16° and 7° at Japan — it gets wider rather than narrower as the region grows, and the exponent it predicts overshoots the measured one by half again.
-
The threshold is not a percolation
The rung below found the near-optimal aspect set breaking into twelve pieces rather than two, called the transition a percolation, and recorded that it had not measured the exponent. Swept finely, the piece count rises from one to twenty-three and falls back to one — and refining the grid by a factor of fifteen does not move the peak, while an uncorrelated field on the same lattice grows by a factor of twelve.
-
The first break is mostly its denominator
Three rungs have fitted the near-optimal set's fracture threshold against region size and read the answer as a statement about the landscape. It is a ratio, and separating it takes one multiplication: the pass's own depth is constant to 12 per cent below twenty degrees of span, and the whole of the threshold's movement there is the denominator — the best score the region admits at all — rising with exponent 0.92.
-
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.