Objective function — where it appears
Named by 14 essays across 3 fields — each of them below, with the objects they name alongside it.
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.
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.
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.
Solving for the map instead of choosing it
Chebyshev's criterion has sat on this site since its second phase with one case it could be applied to: the spherical cap, whose answer is the stereographic projection. For any other region the site stated the criterion and stopped. It is a linear least-squares fit, and the fitted map beats every named projection over the region it was fitted to.
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 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 nearest map to an impossible request
Rung seven found that not every distortion can be asked for. It never asked what happens when one is asked for anyway — and the answer has a shape: the achievable fields are the solutions of an elliptic equation, a request is a point off that set, and the nearest point leaves a residual whose floor is the curvature rather than the size of the ask.
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 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.
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.
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.
Named alongside it
The objects these essays reach for when they reach for this one.
OptimisationAspectDegeneracyRegional distortionConformalityKavrayskiy's criterionPurposeReproducibilitySearchVerificationAggregationAiry's criterion