A globe folded from flat faces
polyhedral-net is the unfolding, face-choice the projection used on each face, and solid-globe the assembled solid the net came from.
Every one of these is the same generator answering a different question, which is why they share a file, a set of colour roles and a set of assertions. Changing it changes all 3.
15 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.
What it draws
One picture per question the family answers. Each has a page of its own.
Where it is called
Changing this changes every one of these figures.
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.
The indicatrix at a point that has none
Ten essays on this ladder take the derivative for granted. Rung three proved the indicatrix is a limit and every figure since has assumed the limit exists. There are points on the maps this collection draws where it does not, and they are not exotic: the horizon of a gnomonic map, and every corner of every polyhedral net.
Hexagons cannot tile the sphere
Hexagons are the best cell shape a plane offers and the sphere will not take them. Euler's formula forces exactly twelve pentagons into any such tiling — twelve at 42 cells and twelve at 642, while the hexagon count rises twenty-one-fold — and each of the twelve is measurably smaller than the hexagons around it.