Everywhere within 3,000 km of London, drawn in Lambert cylindrical
The set of places exactly 3,000 kilometres from London by the shortest route, projected point by point. On the ground it is a circle — every point of it is the same distance from the centre, in every direction. On this page the longest radius from the drawn centre is 4.17 times the shortest, so a reader with a ruler measures two different distances for one ground distance depending on which way the ruler points. The two extreme radii are drawn.
It is drawn by reach-figure with
show: "reach-figure" — one member of a family of
0 figures
that share a generator, so the drawing above is what that generator returns when it is asked
for this one and given nothing else.
9 essays call it. Every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about.
Where it is called
Changing this changes every one of these figures.
A circle of a distance is not a circle
Eleven essays in this field have followed a route across a map. A range ring is not a route — it is the edge of a set — and drawing one exposes a failure the route essays cannot: the same ground distance comes out 4.17 times longer in one direction than another on a common projection, and 13.03 times at 70° north.
Nearest of many is a partition
One reach question with one source is a disc. With several sources it is a division of the whole surface, every place belonging to whichever source is nearest — and computing that division in the plane the data is stored in hands away between 0.75 and 22.16 per cent of the ground, in unbroken strips up to 1,591 kilometres across.
A corridor has a width the page cannot keep
Buffering a line is the most-run operation in spatial analysis and the corridor it produces is a reach set with two failures nobody separates: stroked on the page, one width covers 190 to 471 kilometres of ground along a single route; computed in closed form, the formula stops being the area at a width the route's own length fixes, and eventually claims more ground than the sphere has.
A reach set with a cost that depends on direction
Three rungs build reach sets out of a distance, which 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.
The most compact shape depends on the paper
A geodesic disc attains the isoperimetric bound on a sphere — its score is one, exactly, at any radius. Score the same nine regions from their images on ten projections and four of them put something else on top, an oval and its own 45° rotation come out 4.7 per cent apart, and the projection that preserves the order is not the equal-area one.
The score is not stable at any scale
One boundary, read at eight resolutions from sixteen points to two thousand and forty-eight: the compactness score falls from 0.980 to 0.834 and is still falling. Changing the projection instead moves it by 0.69 per cent. The two decisions are made by the same person on the same afternoon and only one of them is ever reported.
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.
A partition under a directed cost has two versions
Dividing a surface among several sites is one question when the cost is a distance and two questions when it is not. Under a steady flow at 0.45 of a vehicle's own speed, the division by who can reach a place soonest and the division by which place can be reached soonest disagree about 50.7 per cent of the sphere — while no site's own share of the world moves by more than 3.87 points.