Reach set — where it appears
Named by 11 essays across one field — each of them below, with the objects they name alongside it.
A reach set with a cost that depends on direction
A reach set built out of a distance is symmetric and isotropic by construction. Nothing anybody travels is: in a flow at 45 per cent of a vehicle's own speed the same vehicle gets 4,261 kilometres one way and 1,653 the other — a ratio of 2.58 — while the ground it covers grows by ten per cent.
The set that can be reached is not the set that can reach
The moment a cost stops being symmetric, two questions that read alike stop having the same answer. Under a flow at 45 per cent of a vehicle's own speed the set reachable from a place and the set from which the place is reachable have the same area to five significant figures and share 32 per cent of their union — so 68 per cent of the ground in one of them is not in the other.
Every reach set ever drawn is too small
An isochrone is drawn by walking out along a finite number of bearings and joining the points, so its vertices are on the true boundary and its edges are chords — which puts the drawn set inside the true one, always, at every count, for any convex reach set. The deficit falls as the square of the count, and a spherical cap loses less than a circle by exactly cos t (1 + cos t)/2.
The reach set takes the shape of the roads
On open ground a reach set is a disc. On a grid of roads it converges to the convex hull of a diamond and a disc, and once the roads are √2 times faster than the ground between them the ground's speed stops mattering at all. A range ring drawn at road speed then claims 57 per cent more ground than anybody can reach.
A drawn reach set stops at the river
A polygon drawn through a fan of bearings round a reach set is short by a chord deficit that falls as the square of the count — on ground with nothing in the way. Put a river three kilometres off, crossable at bridges, and the polygon misses 30 per cent of the reachable ground at every count from forty-eight bearings to a thousand, and a convergence check passes on it.
A diversion allowance in a wind is the same circle, moved upwind
A diversion rule written in minutes is turned into a distance by assuming still air. In a uniform wind the places from which an airfield can be reached in sixty minutes are not a stretched region but the still-air circle moved upwind by the wind's run. A 150 km/h northerly makes the still-air route across the North Atlantic need a diversion of 68.7 minutes, a southerly makes it 54.0 — and the least radius at which the ocean can be crossed barely moves.
A jet moves the floor that a uniform wind cannot
A uniform wind leaves the least radius at which the North Atlantic can be crossed almost where it was, because it blows the same way on both halves of every gap between airfields. A jet does not. A southerly of 200 km/h past the southern tip of Greenland lowers that floor by 36.9 kilometres, the same jet 400 kilometres further west raises it by 23.3, and one integral of the wind along each gap predicts every such move to within a few kilometres.
A bend in the barrier puts the drawn polygon over water
A straight river leaves the near side of a reach set convex, and that is what makes a fan of bearings fail in one direction only: every chord cuts a corner, nothing is claimed that is not there. A meander breaks that: the near side is no longer convex, and a chord between two bearings can cross water. So the drawn polygon now over-claims as well as omitting — by a seventh of a per cent, at every bend measured, and more bearings do not reduce it. The question was whether the two errors partly cancel. They do not, and the reason is not their signs: the over-claim never reaches a hundredth of the omission, because one scales with the whole set and the other only with the river.
A forecast's error in where the streak is becomes a margin
A jet streak drifting along a gap moves the diversion floor by up to forty kilometres during a crossing, and an operator knows where the streak is only from a forecast. Planned to the worst over the forecast's own crossing window, the floor needs a margin of about eight kilometres for every hundred of error in the streak's position, and stops paying for itself against simply ignoring the streak near an error of two hundred and fifty. Planned to the departure analysis alone, it is worse than ignoring the streak at any error at all.
A reach set drawn from the river's outline is a bound again
Beside a bending river, a fan of bearings drawn with straight chords claims a strip of water, and the drawing stops being a lower bound. The fan's own numbers cannot repair it: what a bearing records about the river is where the bridges are, not where the bends are, and the best a rule built from them does is cut the over-claim by seven eighths while giving up twenty times as much ground. The river's outline repairs it exactly. Cutting each bearing at the first bank costs three and a half times the over-claim it removes; keeping the chords wherever a route over one bridge reaches costs one and a half. Drawn from the outline and the bridges with no fan at all, that route set misses 6.4 per cent of the reachable ground where the fan misses 35.
A layer is a meeting with the bank, not a corner turned
A reach set drawn in layers — rays from the centre, then from every place a route can leave the bank — ends in the exact answer, and how deep it must go depends on what a layer is. Counted by corners turned, the depth belongs to the polygon the bank is drawn as: five turns on a bank drawn every 400 metres, eighteen on one drawn every 50. Counted by meetings with the bank, it is three at every resolution. One meeting anywhere leaves 1.6 per cent of a ten-kilometre walk unreached, where rays from the bridges alone leave 6.4; two leave 0.47; three leave nothing. A longer walk needs more — up to six meetings at twenty kilometres across thirty-six rivers — and the bend's steepness, which prices the first layer, ranks the depth at 0.24.
Named alongside it
The objects these essays reach for when they reach for this one.
VerificationToleranceEstimatorIsochroneClosed formDiscretisationGreat circleAnisotropyBarrierCatchmentConventionCost