Route planning — where it appears
Named by 9 essays across 3 fields — each of them below, with the objects they name alongside it.
Flying a curve in straight legs
Nobody steers a great circle, because a great circle requires the heading to change continuously. What is actually flown is a handful of constant-heading legs between waypoints on it, and the gap between plan and curve falls as the square of the number of legs.
A route that must go round
A shortest route is usually 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.
A projection written as a condition
Instead of a formula, a sentence: the distance from these two places must be exactly right. The map that satisfies it is found by intersecting two circles, it is exact to five parts in a hundred million million, and it exists over the whole sphere for a reason that belongs to the sphere rather than to the construction.
The second derivative over a region
Flexion has been measured at points and over the whole sphere, and never over a region — which is the only unit anybody chooses a projection for. Doing it finds that the second-order criterion moves the winner in one region of four, and that one projection in the library has no second derivative at all.
The shortest route a vehicle can fly
A shortest path under a metric says nothing about 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 shortest route between two coasts
A shortest path is usually asked for 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.
A crossing is a chain of decisions
A route is handed back as a curve, and nothing anybody flies is decided once. Re-planning is worth exactly nothing when the forecast turns out right — a sub-path of an optimal path is optimal, and the chain is the plan. When it turns out wrong it recovers 19 per cent of the cost at two decisions and 83 at eighteen, and never all of it.
The rule that keeps a route near land is pinned at both ends
A crossing that may never be more than a stated distance from an airfield is refused below one radius and free above another, and each wall is set by a single feature of the ocean. Between them the price falls continuously, with corners and no jumps — and at the lower wall it falls as the square root of the allowance, so the first kilometre is worth twelve of route.
A crossing bends by a law only a conformal chart can show
A ship leaving pack ice for open water takes its quickest route by bending at the ice edge, so that the sines of its angles to the perpendicular stand in the ratio of its two speeds. The law has nothing in it but angles, so on Mercator it can be checked with a protractor — and on a plate carrée at sixty degrees north the same crossing reads as a ship making ten kilometres an hour in the ice rather than six.
Named alongside it
The objects these essays reach for when they reach for this one.
Closed formGreat circleShortest pathToleranceVerificationConstraintPurposeCostGeodesicNavigationOptimisationBearing