Generator

The vertices a crease list does not have

A generator in the flat-folding library, called 45 times across 12 essays. Below: what it draws at its defaults and at the arguments the essays give it, what it checked while drawing, and everywhere it is used.

as-drawn is one function. Everything below came out of it during this build, at arguments taken from the essays rather than invented for this page — so a figure here is the same figure a reader meets in an essay, and when the generator changes, this page changes with it.

At its defaults

The vertices a crease list does not haveEvery crease pattern here, read twice: once as the list of vertices and edges it is built from, and once as the ink on the page. The bar is how many vertices the second reading has to invent, which is how many places two creases cross with nothing recorded there.the bar is the vertices the drawing has and the list does notThe preliminary base09 listed · panels closeThe Miura fold035 listed · panels closeThe square twist016 listed · panels closeThe hexagon twist022 listed · panels closeThe Yoshimura pattern045 listed · panels closeFold and cut — the triangle011 listed · panels closeThe tapered corrugation040 listed · panels closeThe waterbomb tessellation041 listed · panels closethe square grid, assembled064 listed · panels closethe triangular grid, assembled1282 listed · panels 1.73 apartthe honeycomb, assembled1884 listed · panels 2.00 apartthe rhombille tiling, assembled12138 listed · panels 1.86 apartthe elongated triangular tiling, assembled576 listed · panels 1.73 apartevery pattern with a bar has panels that cannot be placed, and every pattern without one places exactly

view: "stubs"

A stub is never aloneEvery twist patch this construction draws, at three periods and eight turns, with how many carry a crease that crosses another and how many carry a crease that simply stops. The stubs come in pairs at equal distances from the rim, and every patch that has one has a crossing too.the other fault a drawing can have, counted and measureda stub is a crease with a free end; the distance is how far from the rim it stoppedpatcheswith a crossingwith a stubstubsdistinct depthsshallowestdeepest120761566270.27 mm35.1 mm0.27 mm35.09 mm66 stubs27 depthsdistances at the 150 mm these patterns print at; the scale is logarithmic because the range is a factor of 128

view: "stubs", turns: [0.25, 0.35, 0.5, 0.65, 0.8]

A stub is never aloneEvery twist patch this construction draws, at three periods and eight turns, with how many carry a crease that crosses another and how many carry a crease that simply stops. The stubs come in pairs at equal distances from the rim, and every patch that has one has a crossing too.the other fault a drawing can have, counted and measureda stub is a crease with a free end; the distance is how far from the rim it stoppedpatcheswith a crossingwith a stubstubsdistinct depthsshallowestdeepest75481044190.10 mm38.8 mm0.10 mm38.83 mm44 stubs19 depthsdistances at the 150 mm these patterns print at; the scale is logarithmic because the range is a factor of 391

view: "stubs", periods: [0.28]

A stub is never aloneEvery twist patch this construction draws, at three periods and eight turns, with how many carry a crease that crosses another and how many carry a crease that simply stops. The stubs come in pairs at equal distances from the rim, and every patch that has one has a crossing too.the other fault a drawing can have, counted and measureda stub is a crease with a free end; the distance is how far from the rim it stoppedpatcheswith a crossingwith a stubstubsdistinct depthsshallowestdeepest4029846170.27 mm35.1 mm0.27 mm35.09 mm46 stubs17 depthsdistances at the 150 mm these patterns print at; the scale is logarithmic because the range is a factor of 128

What it checked while it drew

Collected by running this generator with a listener on the assertions, not written here. The count is how many separate times this build put that claim to the test.

Where it is called

Changing this generator changes every figure on this list, which is what makes the list worth publishing rather than keeping in a check script.

A stub is never alone

A crossing is a crease running past another and it has a depth. A stub is a crease that simply stops, and it has one too — how far from the rim it stopped, which is also how much shorter than a crease it is. Measured across a hundred and twenty drawings: sixty-six stubs, from 0.27 mm to 35 mm at printed size, every one of them paired with another at exactly the same distance, and not one on a drawing that did not already have a crossing.

Cutting a patch out of a plane

A tessellation is infinite and a sheet is not, so every picture of one is a decision about where the paper stops. Assembling whole twist units on a square and running the outstanding pleats to the rim puts 12, 18, 12 and 5 creases across other creases on four of five tilings; generating the pattern over a larger region and clipping it puts none. The panels then place exactly — and what is waiting behind the repair is a different refusal that could not be asked about before.

How deep is a crossing

A crossing is a verdict with no middle: two creases either pass through one another or they do not, and the first makes a pattern unfoldable while the second leaves it untouched. Measured on the patches where they occur, the shallowest crossing runs 0.16 mm past the end of the crease it meets, on a sheet 150 mm across. Five of the forty-seven are under half a millimetre, which is thinner than the line a pencil draws.

The crease the drawing cannot show

Twelve creases on a printed crease pattern are eight millionths of a sheet long. They are in every count the collection takes of that patch, they pass every theorem, and no printer resolves them and no hand folds them. They are also the only thing holding the folded sheet together.

The drawing does not say what is glued

One crease pattern, four sheets, four different answers to whether it folds — and nothing in the drawing distinguishes them. The identification is data the picture cannot carry, and the picture is the object this collection has been treating as complete.

The order the refusals come in

This collection can say no to a crease pattern in five ways, and they cost wildly different amounts: a sweep over pairs of creases, a pass over the vertices, a walk over the panels, a pass over the crease list, and an enumeration of every ordering of the panels. Run all five over the thirty-three patterns in the four test populations and the cheapest refuses five, the most expensive refuses six, and the three in between refuse nothing at all.

The reader decides the junction

Five of the eight patterns printed here have places where one crease ends on another — four on the preliminary base, eight on the square twist, twelve on the hexagon twist, nineteen on the Yoshimura, three on the fold-and-cut triangle. At each of them a reader has to decide whether two lines meet or pass through one another, and no notation, caption or teaching text in the subject mentions that the decision is being made.

The refusal that reads the list once

There are five ways of saying no to a crease pattern here, and their costs are two hundred and eighty-two, a hundred and twenty-six, a hundred and fifty-seven, thirty-nine thousand six hundred and twenty-one — and a search that is refused outright. On the largest patch the four cheap tests together do less work than one of them looks like it should, and the fifth cannot be started. A refusal that reads the crease list once is the only kind that scales.

The vertex the list does not have

Every condition this collection checks is asked at a vertex of a crease pattern, and a crease pattern is handed to the checker as a list of points and segments. A reader is handed ink. Read the same patterns the second way and eight printed sheets gain nothing at all — while four tessellation patches gain 12, 18, 12 and 5 vertices that nobody wrote down, every one of them a place where two creases were drawn across each other.

Two creases that cross

A crossing is four creases at a point, so the four conditions of the subject apply to it — and three of them can be satisfied. It is developable at every angle, it satisfies the big-little-big lemma whenever its two lines carry different letters, and it satisfies Kawasaki's condition when the lines meet squarely. Maekawa's refuses it always, at every angle and under every lettering, because a crossing's four spokes belong to two creases and can only be four and none, two and two, or none and four.

Two faults, not four

A drawing departs from its crease list in four named ways — a crossing, a stub, a junction and a fragment — and a checker tests for all four. Counted side by side on two hundred and forty drawings, two of the tests find nothing the others do not. No crease anywhere ends on another crease: every junction the reading finds is a crease meeting the rim, which is where creases are meant to end. Every stub is on a drawing that already has a crossing. What is left is two independent faults, and the clipped construction, which makes no crossings, still makes the second — creases a thousandth of a millimetre long, in pairs.

Two mechanisms at one point

Two creases drawn across each other cannot fold flat — Maekawa's count refuses them at every angle. They move perfectly well as rigid panels, and they move in two ways: bend along one line while the other stays flat, or the reverse. Every other developable vertex of degree four has two ways too, and in both of them all four creases move together at a fixed ratio. The crossing is the case where the two motions have nothing to do with each other.

Every generator · The flat-folding field · The patterns a reader can fold