Polyhedral — the ladder
-
The globe on a solid
Cylinder, cone and plane are not the only surfaces a sphere can be laid on. Project it onto a polyhedron and the curvature goes entirely to the corners — π at each of the tetrahedron's four, π/5 at each of the dodecahedron's twenty, and always 4π in total, which is exactly the curvature of the sphere it replaced.
-
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.
-
What a face can preserve
The obvious map onto a polyhedron's face is the gnomonic, and it draws every great circle straight while stretching the corners by a factor of 1.50. Replace it with a construction that holds the areal factor at one to a part in a million and the shape error rises from 8.0° to 11.9° — the same trade the whole sphere forces, arriving on a piece of it a twentieth the size.
-
A conformal map onto a face
The polyhedral ladder ended owing a conformal face map, on the grounds that it needs elliptic functions. It does not: a conformal map of the sphere is an analytic function of one conformal coordinate, so the map is a power series, choosing it is a least-squares fit — and its scale factor is infinite at the corners, which is the angle deficit arriving as a singularity.
-
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.
-
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.
-
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.
-
What the net heuristic cannot find
Rung seven chose a net by unfolding outwards from a face and showed the choice beats guessing, and recorded that its own limit was 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.
-
The gnomonic crosses a seam without a corner
Eight rungs choose a solid, a face map and where to cut. This one is about a seam the net does not cut, where two faces stay joined and carry two different maps — and the expectation was a corner in every feature crossing one. At the midpoint of the edge — which is where every crossing here is taken, and which turns out to be the one place on it a face's own mirror forces the corner to vanish — the gnomonic gives none at any obliquity on any Platonic solid, and the equal-area face map gives one of up to 0.39 degrees.
-
The corner is not at the midpoint
The rung below measured the corner a feature gets crossing a polyhedral seam, and found none at all under the gnomonic face map. It crossed at the edge's own midpoint every time — the one point on the edge where a face's own mirror symmetry forces the corner to vanish. Two fifths of the way to the vertex the gnomonic gives 20.15°, the equal-area map 7.28° and the conformal map under a degree, which reverses the ordering entirely.
-
The exact map says the seam is smooth
The previous rung could only bound the conformal seam's corner at about two degrees, because the series it was fitted with holds its boundary condition to three parts in a thousand. An exact map exists — the stereographic projection composed with ∫dt/√(1 − t⁴) — and it settles it: the corner falls in exact proportion to the arc the tangent is read over, fitted exponent 0.99, while the gnomonic's 21.4572° is the same to four decimals at every span.
-
The span ladder, run on all five
A recorded shortfall said the exact map's span ladder was one loop away from settling the seam on the five Platonic solids. The loop was run and the answer is the other one: the series conformal face map has a corner that does not shrink with the measurement span on any of them — 4.10° on the tetrahedron, 0.77 on the cube, 0.004 on the icosahedron — and it belongs to the truncation rather than to conformality.
-
The corner that is the curvature
Every face map is singular at a vertex, so a corner that grows as the crossing walks towards one should run away. It does not: the gnomonic settles at 53.1295° on a cube and the equal-area map at 12.9656, both finite, both reached like the first power of the remaining gap. What does not settle is the deficit beside them — 90 degrees, fixed by Descartes before any projection is chosen.