How this site is made

The figure library

Every picture here is generated from code at build time. This is every generator, ordered by how many essays call it, each rendered at its defaults.

No figure on this site is a drawing that was made once and saved. Each one is a function: it takes parameters and returns SVG, so the same generator produces the 27° twist and the 5° twist without either being redrawn.

That is the reason the collection can keep growing without the illustrations drifting apart. A generator is written once, checked once, and every essay that calls it inherits the same line weights, the same colour roles, and the same behaviour in dark mode. There are 162 of them. The most-used — lettering-search — is called by 29 essays; the least-used by one.

Ordering them by how many essays call each one is new, and it is the point of this page rather than a nicety. A generator written for one essay and never called again is a design failure — it means an argument was drawn rather than a mechanism understood — and until this page existed the only way to notice was a number in a ledger. Now the tail is visible: the generators at the end of the list are the candidates for parameterising into something a second essay can use.

Each of them now has a page of its own, and what those pages carry is not the picture — it is what the generator checked before it drew. A crease pattern here goes past four theorems at every interior vertex, and until this phase the only evidence that it had was a build that did not crash: a passing assertion left nothing behind, so the account of what this code verifies lived in prose, and prose about what code does drifts in one direction only. It is measured now, by running each generator with a listener on its assertions. 162 of the 162 made a claim during this build, 2231 distinct claims between them — and the eleven that made none say so on their own pages, which is the point of measuring rather than listing.

Several of these draw patterns a reader can print and fold. Those are collected on the patterns page, with a sheet at true scale and a FOLD export for each.

What a witness costs, against how rare one is5 tessellation patches. The bar is how many nodes a search visits before returning a lettering whose arcs have no loop in them; the note beside it is how many of 200 letterings drawn at random from the same pattern turn out to agree with themselves. 2 of them were never given one by the draws.the bar is how many nodes the search visited before it found onethe note is how many of the same pattern's random letterings agree with themselvesthe square patch2649 panels · 26 of 200 drawn letterings agreethe elongated patch3562 panels · 5 of 200 drawn letterings agreethe hexagonal patch4177 panels · 2 of 200 drawn letterings agreethe triangular patch4783 panels · 0 of 200 drawn letterings agreethe rhombille patch561157 panels · 0 of 200 drawn letterings agreea search that stops at the first witness; nothing here counts how many there are
How often a redrawn lettering is consistent with itselfIndependent letterings drawn from each pattern, and how many of them the letters do not contradict. A pattern this site prints is nearly always consistent whatever letters it is given; a tessellation patch cut from the same construction almost never is.the bar is the share of draws whose letters agree among themselvesa draw that disagrees is a proof that the pattern has no flat folded state with those lettersthe preliminary base200 of 2008 panels · 8 creases · 0 contradict themselvesthe square twist198 of 2009 panels · 12 creases · 2 contradict themselvesthe Yoshimura190 of 20065 panels · 86 creases · 10 contradict themselvesthe Miura fold181 of 20024 panels · 38 creases · 19 contradict themselvesa square twist patch26 of 20049 panels · 84 creases · 174 contradict themselvesa hexagonal patch2 of 20077 panels · 142 creases · 198 contradict themselvesa rhombille patch0 of 200157 panels · 282 creases · 200 contradict themselvesthe sampler returns solutions rather than a uniform draw over them, so these are shares of what it found
The coin's forty answers and the constant's one, on the rhombille patchNode counts for 40 runs of one lettering search on one crease pattern of 157 panels and 282 creases, ranked. Under the search's own random choice of which letter to try first the cost runs from 86 to 15872 with 15 runs unfinished; under a constant choice every run costs 80.the dot is one run's cost, ranked; the rule is the constant order1001e+31e+4nodes visited40 seeds, ranked by cost80 nodes, every seed15 unfinished at 20,000same pattern, same conditions, same test at every node — the only difference is which letter is tried first
How much of a folded sheet lies over the rest of itFor every crease pattern this site prints at true scale: the pairs of panels that share ground in the folded state, the non-crossing rules those pairs generate, and whether an ordering of the panels was found, refused or ruled out.the bar is the pairs of panels that lie over one anotherThe preliminary base288 panels · 12 rules · an ordering existsThe Miura fold22824 panels · 228 rules · not decidedThe square twist369 panels · 48 rules · an ordering existsThe hexagon twist6613 panels · 96 rules · an ordering existsThe Yoshimura pattern205565 panels · 1187 rules · not decidedFold and cut — the triangle217 panels · 15 rules · an ordering existsThe tapered corrugation28228 panels · 351 rules · not decidedThe waterbomb tessellation92652 panels · 654 rules · not decideda pattern with no bar has no two panels over one another, and its order is not a question
One period of the square twist tessellation, with its edges joinedThe crease pattern of a single repeating cell of a twist tessellation on the square grid, drawn on the rectangle it repeats in. The rings mark where a crease meets a side of the cell: each one on the left is the same crease as one on the right, and each on the bottom the same as one on the top. Joined that way the 40 pieces are 32 creases, the 25 drawn panels are 16, and all 16 vertices are interior.one period of the square grid's twist tessellationa ring is where a crease leaves and returns on the far side40 crease pieces → 32 creases25 drawn panels → 16 panels16 vertices, every one interiorV − E + F = 0mountainvalleyraw edge
A vertex that folds flatFour creases at one point, with the sectors between them measured and both flat-folding conditions evaluated. Kawasaki constrains the angles and Maekawa constrains the assignment; a vertex needs both, and they are independent of one another.VMMM60°90°120°90°Kawasaki60° + 120° = 180°90° + 90° = 180°both 180° — satisfiedMaekawa3 mountains, 1 valleysdifference 2exactly 2 — satisfiedangles sum to 360°which is what a flat sheet requiresmountainvalley
One rectangle, glued four waysThe same rectangle of paper with the same creases on it, four times: cut out of the plane in the ordinary way, with its left and right edges declared to be one edge, with its top and bottom edges declared to be one edge, and with both. Matching arrowheads mark the pairs. Nothing in the crease pattern distinguishes the four, and each of them is a different sheet of paper.one rectangle, glued four waysa disc, two cylinders and a torus — from one drawing4 edges lefta disc2 edges lefta cylinder, across2 edges lefta cylinder, alongno edges lefta torusthe same rectangle and the same creases in all four, and nothing in the drawing says which is whichmatching arrowheads mean the two edges are one edge of the paper
What a flat sheet can becomeA sheet that cannot stretch can only take shapes with zero Gaussian curvature everywhere — cylinders, cones and the general developable surface. A sphere or a saddle curves in two directions at once and no amount of folding reaches one, which is why a paper globe has to be made of gores.cylinderreachablecurved one way onlyconereachablecurved one way, from a pointsphereunreachablecurved two ways — impossiblesaddleunreachablecurved two ways — impossible
A strip, folded, with its layers solvedA one-dimensional crease pattern and the stack it folds into. In one dimension the layer ordering can be decided exactly, so the arrangement below is a solution found by search rather than a drawing of a plausible one — and when no arrangement exists the figure reports that instead.MVMV123455 segments, 4 creases12345the stack, solvedassignmentsMVMVvalid stacks1decided byexhaustive searchover the orderingsthe folded positions come from the crease spacing; the assignment only decides which way each turn wraps
What folding is used forDeployed area against packed area for several engineered folds. The pattern earns its place when something has to be large in use and small in transit, and every one of these is a case where nothing else would fit.Miura solar array17×Space Flyer Unit, 1995airbag folding25×stored for years, opens in 30 msheart stent6×threaded through an arterystarshade11×26 m disc, 2.5 m launch tubemap fold9×the original problempackeddeployedthe ratio is what is bought; one degree of freedom is what makes it reliable
How much surface fits in a bodyThe surface a corrugation holds inside a fixed box, against the number of folds. With no thickness the answer rises without limit and folding is free. With a thickness the stack eats the depth it is folding into, the curve turns over, and past a certain count the box is full of sheet and holds no surface at all.0204060801001200510152025foldssurface heldpeak at 64 foldsbox of side 1 · sheet thickness 0.01 · most surface at 64 folds · 128 folds fills the box with sheet alone
What one fold can refer to, and what two canThe set of points a folder can refer to, after nothing, after one fold and after two. Every axiom names points and lines that must already exist, so the reachable set is finite at every depth: four corners, then nine references, then several hundred. The faint lines are the folds the axioms specify; the marks are the crossings that land on the paper.the bare sheet4 references · 4 linesnothing has been foldedafter 1 fold9 references · 12 lineshalves, and nothing elseafter 2 folds565 references · 92 lineshalves, thirds, fifths — and worsea fold is an alignment, and an alignment needs something already on the paper to align565 references after 2 folds, and the count is finite however many folds are allowed