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

Spanning tree — where it appears

A set of edges joining every face of a solid without a loop, which is what a net keeps and whose complement is what a net cuts. Every net of a Platonic solid cuts the same total length, and the nets differ in how far apart the cuts push places that were neighbours.

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

Which edges to cut is a spanning tree. The icosahedron's faces as nodes and its 30 shared edges as links. A net keeps 19 of those joins and cuts the rest, and the joins have to form a spanning tree — connected, so the net is one piece, and acyclic, so it lies flat. The heavy links are one such tree. The number of distinct nets is therefore the number of spanning trees of this graph, which Kirchhoff's theorem gives as a determinant: 5,184,000 for the icosahedron.

The cut has to go somewhere

A solid lies flat only if it is cut open, and which edges to cut is a spanning tree of the face graph — so the icosahedron has exactly 5,184,000 distinct nets, a determinant rather than an estimate. All 384 of the cube's were laid flat and tested: not one overlaps, while an irregular tetrahedron overlaps in four of its sixteen.

families · Polyhedral Past the five solids: what more faces buy, and what they cost. The icosahedron subdivided 2, 3, 4, 6, 8 ways, giving 20, 80, 180, 320, 720, 1280 faces. The worst angular deformation inside a face falls from 13.1° to 0.26°, with a fitted exponent of -0.947 against the face count — the reciprocal, as it must be, because a face's angular size goes as the inverse square root of the count and the gnomonic's deformation goes as the square of that. The total cut length rises from 11.6 to 96 sphere radii, fitted at 0.509. Both exponents together say the whole economics of the family in one line: halving the distortion costs √2 times the cutting, for ever.

More faces, less distortion, more cutting

The five regular solids are where polyhedral mapping stops, and they stop because there are only five rather than for any reason about maps. Subdivide instead, and the family runs to any number of faces with two fitted exponents: distortion falls as the reciprocal of the count and cutting rises as its square root.

families · Polyhedral Two nets of the same solid, cut to the same length. Every net of a Platonic solid severs exactly the same number of edges, all of the same length, so the total length of the cut is a constant and cannot choose between them. Each line joins the two places a severed edge ends up. Left: the net that keeps them closest, 11.30 edge lengths in total. Right: the net that puts them furthest apart, 17.97 — a factor of 1.59 for the same amount of cutting.

The net that loses the fewest neighbours

Every one of the cube's 384 nets cuts exactly seven edges of exactly the same length, so the quantity this collection has been pricing cutting by is a constant that cannot choose between them. Measured on the reader's side — how far apart a net puts two places that touch on the globe — the best net scores 11.30 and the worst 17.97, for identical cutting.

families · Polyhedral Two unfoldings of the same 80-face solid. Both are edge unfoldings of the same solid along different spanning trees of its face graph, so both preserve every distance on the surface exactly. The left one is a net. The right one is not: 3 pairs of its faces occupy the same ground, so it cannot be cut out of paper and folded up. Nothing in the unfolding procedure prevents this, and past the regular solids most trees produce it.

A net can land on top of itself

Every one of the cube's 384 unfoldings is a net, and every one of the icosahedron's five million is too. Past the regular solids that stops being true: at 180 faces, 99 of every 100 randomly chosen unfoldings have faces sitting on top of each other, so choosing a net stops being a choice and becomes a search — except that the net anybody would actually draw works every time.

families · Polyhedral Every one of the cube's 384 nets, scored. All 384 spanning trees of the cube's face graph, unfolded and scored on the total separation their cuts leave: how far apart, in edge lengths, the two copies of each cut edge end up on the page. Every one of them is a valid net — no Platonic unfolding overlaps — and they range from 11.30 to 17.97, a factor of 1.59. The heuristic of unfolding outwards from a chosen face lands on the first of them, exactly.

What the net heuristic cannot find

Choosing a net by unfolding outwards from a face beats guessing, and the earlier measurement of that left its own limit 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.

families · Polyhedral Five bearings of four cities, held exactly. A flat picture of London, New York, Tokyo, Sydney holding five one-way bearings exactly, each drawn as an arrow from the city it is measured at: London to Tokyo, Sydney to London, New York to Tokyo, New York to Sydney, Tokyo to Sydney. Five is the most any flat picture of four places can hold, and of the 192 ways of choosing five pairs and a direction on each, this is one of eight that can be drawn with every arrow pointing forwards; all eight leave London–New York, dashed, unheld. The price is paid by the other seven bearings: the worst, London to New York, is 165.0° from the truth.

Five bearings of twelve, and only eight ways to draw them

A flat picture of four places can hold five of their twelve one-way bearings exactly, the same count as distances, and the five are found by solving equations rather than searching. The equations cannot tell a line from its reverse. Of the 192 ways to choose five, eight can be drawn with every arrow pointing forwards, all eight leave London and New York unheld, and on sixteen cities no choice made at random can be drawn at all.

impossibility · Embedding

Named alongside it

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

Platonic solidPolyhedral projectionCombinatoricsInterruptionIcosahedronTopologyAngle deficitEuler characteristicFaceGoldberg polyhedronHeuristicLower bound

All concepts