Optimisation — where it appears
Named by 37 essays across 8 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.
A datum is fitted to a region
Forty countries adopted forty ellipsoids, and the usual explanation is that measurement was poor. It was not — a figure fitted to one country beats the global one over that country by a factor of seven, and what it removes is a systematic bias of two metres in every kilometre.
The scale factor was chosen
A grid's scale factor is not a constant of nature. Britain's 0.9996012717 is the reciprocal square root of the worst distortion a tangent projection would have had over the country, it halves the worst-case error exactly, and the halving is the most that construction can ever buy.
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.
Designing a grid for one region
A country with a grid of its own beats the international zone that would otherwise carry it by a factor of 1.51. That is worth having and it is much less than the argument is usually made to sound, and the difference between the two numbers is the whole case for and against national grids.
Where the worst point is
The largest scale error on a conformal map of a country is always on the frontier, never inside it, whatever the country's shape and whichever conformal projection was chosen. It is a theorem rather than a tendency, and it is the reason Chebyshev's criterion works.
A route that must go round
Every route on this site so far has been free to go anywhere, and no real route is. The shortest path past a circular exclusion is two tangent great circles and an arc of the rim — a closed form that agrees with a shortest-path search to three metres in 9,598 kilometres — and it costs not the obstacle's size but the square of how far the obstacle reaches past the route.
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.
The azimuthal family is one function
Five azimuthal projections are taught as five viewpoints — from the centre, from the far pole, from infinity. They are one projection with five choices of how far out to draw a point at angular distance ρ, and each named property is a differential equation in that one function: f′ = f/sin ρ integrates to the stereographic projection and f f′ = sin ρ to Lambert's, from nothing but true scale at the centre.
The rule of thumb, scored
Cylindrical near the equator, conic in the middle latitudes, azimuthal at the poles. It is the most repeated piece of practical advice in cartography and it has never been run against a population of regions. Run against thirty, it is right nineteen times, and every one of its failures has the same shape.
The rule scored out of sample
A replacement rule was read off thirty regions and scored on the same thirty, and this collection recorded that as not being evidence about any other thirty. It is: on forty-five different regions the rule scores 91 per cent against the 83 it managed at home. What it cannot do is the seven regions the collection actually uses, where both it and the rule it replaced name the winner twice out of seven and cost a mean factor of 14.6.
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 best grid a country could have had
A national grid is a conformal map chosen for one region, so its whole design problem is one number: the spread of its scale factor. That number has a theoretical floor, this site can now compute it, and the adopted grid turns out to be either exactly optimal or half as good again — depending entirely on which box the country is declared to be.
The shortest route a vehicle can fly
Nine rungs find the shortest path under a metric and none asks whether the thing travelling can follow it. Bound the curvature and the route depends on two headings as well as two positions: the turning cost is a fixed 1.81 kilometres whatever the leg length, so it is 18 per cent of a short leg and 0.28 per cent of a long one, and the whole of it vanishes when the vehicle happens to be pointing the right way.
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.
Sixty zones was a decision about one latitude
Twelve rungs price a grid, a zone, an origin and a reference, and every one of them works inside a single zone. The number of zones has never been asked about: six degrees meets its tolerance at the equator and is loose everywhere else, so a system spending the same tolerance evenly would use 51 zones at the equator and 8 at 82° — and UTM's worst error is 981 parts per million, not the 400 always quoted.
What the net heuristic cannot find
Rung seven chose a net by unfolding outwards from a face and showed the choice beats guessing, and recorded that its own limit was unknown. Enumerated in full, the heuristic turns out to be exactly optimal on every solid small enough to check — rank one of 384 — and above that ceiling no sample can tell whether it still is, because eight hundred random nets never reach it.
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 shortest route between two coasts
Ten rungs find the shortest path between two points. Between two regions the answer is attained at a pair of boundary points, and which pair is not the pair any page makes look nearest — a cylindrical map picks a pair 2,135 kilometres from the right one across the Atlantic, and 1,716 kilometres wrong between Chile and New Zealand, where its route is 22.5 per cent long.
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.
How wrong a flat picture has to be
The rung below proves no flat picture of four places is exact and leaves the size of the failure to a determinant nobody can read. Measured directly, the least error falls as the square of how much sphere the places span — fitted exponent 2.0088 — and the same exponent comes back from five different arrangements while the constant in front of it moves by a factor of seventeen.
The best flat picture is not a map
A set of dots whose separations are as nearly right as separations can be made beats every projection in this collection — by a factor of thirteen on four world cities, and by eight per cent on sixteen. The collapse between those two numbers is not about cartography. It is that a picture of n places has 2n − 3 free numbers and n(n − 1)/2 distances to spend them on.
A family is not closed under averaging
Nine rungs treat a family as a set of maps with a parameter running through it, and this collection's own compromise projections are averages of members. An average of two members is not a member: two conics far apart average to something 31 per cent of their own separation outside the family — and averaging within a family makes the map worse every time, while averaging across two makes it 16 per cent better.
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.
Which projection a weighting can make best
Rung eight finds the seven world projections nothing beats on both counts and tells a reader with a preference that one of them is their answer. Four of the seven are not: they sit in dents of the front, undominated and unreachable, and no weighting of angle against area can ever put them first. Robinson can be first, on 2.8 per cent of the weight range.
The ranking is not an order
The previous rung showed that a weighting can make almost any projection best. Remove the weights entirely, let each of the seven criteria vote once, and the answer is worse: over the whole sphere Mercator beats the sinusoidal, the sinusoidal beats Eckert IV, and Eckert IV beats Mercator — four such circles, every margin four to three, with a Condorcet winner sitting above them all.
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 nodes were evenly spaced
The previous rung showed that refining an evenly collocated fit improves the solver's report and leaves the map alone. Moving the same number of nodes to the Chebyshev positions — crowded toward the corners, where a conformal map of a polygon is singular — makes the fit settle: 7.030 × 10⁻⁵ at forty-eight nodes and exactly that at every count above it, against an even fit that wanders by 43 per cent and never converges at all.
A family is a function, not a list
The equal-area pseudocylindricals are the solutions of one equation in two unknown functions, so one function is free and the named members are points in a space of them. Writing that function as six numbers and searching over them finds a map at 25.03° of mean angular deformation against Eckert IV's 28.08 — and two numbers are already enough to beat every map the family has a name for.
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 maps with no family are simply better
Rung eight found seven projections with no continuous symmetry and noticed they are almost exactly the set anybody would choose for a world map, then offered a conjecture with a test attached: their advantage should collapse under a criterion that does not care where anything is. Run, it does the opposite — 1.343 times under a uniform weighting and 1.204 under a concentration. The conjecture is refuted.
The cheapest map that meets its areas
An earlier essay bracketed a cartogram's least cost between a construction charging eighty degrees and a bound valid only for symmetric densities, and recorded the gap as a shortfall. One request settles it: a density of contrast eighty whose least cost is exactly zero, met by a map written down in closed form, while the standard construction charges 43.8° for it.
The best compromise for angle is not the best for bending
Every compromise projection in the library is an average of two others, and averaging is a first-order operation — so the second derivative was never part of the bargain. Swept along five ordinary blend paths, the weight that minimises angular deformation and the weight that minimises flexion are between a quarter and a half of the axis apart, and how much a compromise buys at one order predicts nothing about the other.
Named alongside it
The objects these essays reach for when they reach for this one.
PurposeAspectVerificationClosed formObjective functionTrade-offConformalityKavrayskiy's criterionRegional distortionToleranceDegeneracyRegion