Cartographic Projection
every map is wrong, and by exactly how much
Concept

Barrier — where it appears

Ground a traveller cannot cross except at stated places, such as a river crossed only at its bridges. It is what makes a reach set more than a disc: distance becomes the length of the shortest path round it, and every bearing that meets it stops, doubles back or resumes on the far side.

Named by 2 essays across one field — each of them below, with the objects they name alongside it.

What 16 bearings draw beside a river that bends. Everywhere within a 10 km walk of the centre, with a river 3 km to the north meandering ±2.0 km on a 4 km wavelength, crossable only at bridges every 2.5 km. The reachable ground is shaded — pale where it is reached directly and darker where the walk had to go by a bridge. The outline is the polygon 16 bearings draw. It misses 34.1% of the true ground, as a fan beside a straight river does, and it also CLAIMS 0.14% that is not there — ground cut off by a bend, which a chord between two neighbouring bearings passes straight over.

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.

paths · Reach Beside a bending river, the fan's chords cross water; a route drawn from the river's own outline never does. Everywhere within a 10 km walk of the centre, shaded pale, with a river 3 km north meandering ±2.0 km on a 4 km wavelength and bridges every 2.5 km. Left: the polygon 16 bearings draw, with the ground it claims and should not in solid ink — chords spanning the bends. Averaged over where the first bearing falls, it misses 35.0% of the true ground and claims 0.15% that is not there. Right: every point reachable by a route with at most one crossing — straight out, or straight to a bridge and straight on — worked out from the river's outline and the bridges alone, with no fan and no shortest path. It misses 6.4% and claims nothing.

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.

paths · Reach

Named alongside it

The objects these essays reach for when they reach for this one.

ConvexityPolygonReach setShortest pathVerificationEstimatorLower boundNon-convexityQuadratureSamplingTolerance

All concepts