The waterbomb tessellation
Fold it
The sheet is on the printed page, at the size it says.
Printing this page gives the page, and adds one more: the pattern alone, at 160 mm across, on a sheet of its own. Cut a square that size, transfer or trace the lines, and fold. The size is repeated in the corner of the sheet, because a printer set to fit to page rescales silently and there has to be some way to notice.
Mountain and valley are distinguished by dash as well as by colour, so the sheet survives the monochrome laser printer it will almost certainly come out of.
What it is
| Provenance | Traditional base, tiled — the tiling is generated here |
|---|---|
| Creases | 40 mountain, 36 valley |
| Interior vertices | 25, every one checked |
| Panels | 52, read off the pattern |
| Folding to do | about 2290 mm of crease at this size |
| Printed sheet | 160 mm across |
What was checked
Four theorems at every interior vertex, and the faces two ways.
- Developability — the sectors around each of the 25 interior vertices sum to a full turn, so the sheet was flat before it was creased.
- Kawasaki — alternating sectors sum to a straight angle at each of them.
- Maekawa — mountains and valleys differ by exactly two.
- Big-little-big — no strictly smallest sector is flanked by two creases of the same letter.
- The faces — 52 of them, found by walking the planarised graph, and checked against Euler's formula and against the area they cover. A face walk that goes the wrong way round or merges two faces usually still satisfies Euler; it does not conserve area.
None of this decides whether the whole sheet folds flat, which is NP-hard in general. Every local condition holds. That is a different and weaker statement, and it is the one being made.
Take it away
The field's own interchange format, so the pattern is reusable outside this site.
waterbomb-tessellation.fold — 41 vertices, 92 edges, 52 faces, 7012 bytes. It opens in ORIPA, Rabbit Ear and the rest of the FOLD ecosystem.
The export is short because this repository never converts anything: FOLD's
vertices_coords, edges_vertices and edges_assignment
have been the in-memory representation of a pattern here since the site's first phase. What
the file adds is the metadata that makes it openable, and the faces where they can be read.
Coordinates are in sheet widths, and the file says what one unit measures on paper.
What is argued with it
Essays that call waterbomb-pattern — read off the figure index rather than listed by hand.
Where the paper stops
Every flat-folding theorem is a statement about a full turn of paper, so a vertex at the edge of the sheet is subject to none of them. Cutting a patch out of a pattern removes conditions rather than preserving them, and a small enough patch has almost none left.
The base that tiles
The waterbomb base is the first thing most people fold and the last thing they think about. Repeat it across a sheet and it becomes a tessellation with two kinds of vertex, an assignment that has to be searched for rather than remembered, and a folded state thirty-two times smaller than the paper.
A unit that folds is not a tessellation
Of the 512 repeating rules for the waterbomb tessellation, 56 pass every condition on a two-by-two patch and 32 pass on every larger one. The twenty-four that die were never foldable — the small patch simply contained one of the four kinds of vertex the pattern makes, and the failures were at the other three.
Thirty-two rules, one object
Five hundred and twelve repeating rules for the waterbomb tessellation, fifty-six that pass on a small patch, thirty-two that pass on one containing every kind of vertex. Fold all thirty-two and compare their panels: the same panels, in the same places, with the same areas, every time. The rules are thirty-two labels on one object, and a count of them has counted the labels.
The rule that breaks the count
The waterbomb tessellation has five hundred and twelve repeating rules for its letters and thirty-two of them fold. A hundred and twenty of the other four hundred and eighty send four panels round in a circle — the shortest circle a crease pattern can have — and every single one of those hundred and twenty has broken Maekawa's count at the very vertex the circle goes round. The theorem that closes the shortest circle, caught doing it, a hundred and twenty times.
Where a rule can close a loop
Three corrugation families have repeating rules whose letters send four panels round in a circle, and one has none at all. The one that has none is the one whose vertices are all of degree six — and the reason is that a straight line through a point carries a single letter under any repeating rule, while a strict alternation round six creases needs the two halves of that line to differ.