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

Angle deficit — where it appears

How far the face angles meeting at a polyhedron's corner fall short of a full turn — the curvature of a surface that is flat everywhere else. Descartes' theorem fixes the total over a convex polyhedron at exactly 4π steradians, so subdividing a solid spreads the deficit more thinly and never removes any of it.

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

The icosahedron's faces, drawn on the sphere. The edges of the icosahedron projected radially onto the sphere, which is the partition of the world a polyhedral map uses: everything inside one spherical polygon is drawn on one flat face. Each face spans 25.8° from its centre to its own boundary, and the gnomonic map onto it reaches 6.6° of angular deformation at the corners. Drawn in an orthographic projection of the embedding, which is a map with its own distortion.

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.

families · Polyhedral 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 The conformal map onto a square face of a cube. The spherical face of a cube carried onto its flat face by a map that is conformal everywhere — the measured angular deformation over the drawn interior is 1.63e-6°, which is the arithmetic's own floor. The rings and spokes are circles and radii on the sphere, and they cross at right angles here because that is what conformal means. The map was solved for as 16 terms of a series rather than written down: the face's edge comes out straight to 0.33 per cent of its own half-width, and that residual — not the conformality — is what more terms buy. At each corner the map behaves like ζ^0.75, so the scale factor there is infinite.

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.

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 The indicatrix is a limit, and here it is being taken. The axis ratio of the image of a circle of radius ρ, measured from the picture rather than computed from the derivatives, against the ratio the derivatives give. It converges, and it converges as ρ² — each halving of the radius quarters the departure. At the smallest radius drawn the two agree to 7.6e-4 relative. This is what "the indicatrix is a limit" means when it is working: there is a number for the ratio to settle on, and it settles.

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.

distortion · Tissot A hexagonal tiling of the sphere, and its pentagons. 362 cells — 350 hexagons and 12 pentagons, the pentagons marked — drawn on Orthographic. The twelve are not a defect of the construction and cannot be removed by subdividing further: Euler's formula requires exactly twelve however many hexagons there are. Each pentagon here has 0.52 times the area of an average hexagon, so a count aggregated over these cells has twelve entries that mean something different from all the others.

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.

applied · Cells Bigger triangles, and how much bigger depends on what is fixed. How well a survey can resolve Gaussian curvature, against the side of its triangles, under three things being held fixed. One triangle: the accuracy improves as the inverse SQUARE of the side, fitted exponent -2.000. A chain of fixed length, which is what every great arc was: bigger triangles mean fewer of them, and the exponent is -1.503 — exactly three halves. A network covering a fixed area: -0.999, exactly one. The trade depends on what a survey is short of.

How many triangles it takes

Rung eleven priced one triangle and recorded that a survey observes hundreds. Averaging n of them divides the noise by √n, and n is not free: a chain of fixed length holds fewer big triangles than small ones, so the accuracy improves as the side to the power three halves rather than two. Struve's 141 triangles of forty kilometres are worth exactly Gauss's seven of eighty-five.

impossibility · Curvature Walking the crossing all the way to a cube's vertex. The corner a feature gets crossing the seam, at crossings that approach the vertex geometrically — the last is 3.5e-4 degrees from it. Every face map is singular at a vertex, so the expectation is that the corner runs away. It does not. The gnomonic settles at 53.1295° and the equal-area map at 12.9656°, and both are finite. The dashed line is the solid's angle deficit, 90.0°, which is what the surface loses at that point and is not what either map's corner reaches.

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.

families · Polyhedral

Named alongside it

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

Polyhedral projectionPlatonic solidClosed formEuler characteristicGaussian curvatureGnomonicInterruptionTopologyConformalityConvergence rateFaceGauss–Bonnet theorem

All concepts