Origami & Folding
what one sheet can do
Concept

Face graph — where it appears

The graph whose nodes are a pattern's panels and whose edges are the creases between them. Two-colourability, the folding motion and the layer order are all read off it rather than off the drawing.

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

20 panels, two coloursno crease has the same colour on both sidesall 12 interior vertices carryan even number of creasesthe colour is which side of the paperthat panel shows when the sheet is foldedmountainvalleyraw edge

The sheet has two sides

Read a crease pattern as a set of panels rather than a set of lines and a condition appears that no vertex theorem states: the panels take two colours, no crease has the same colour on both sides, and the colour is which face of the paper each panel ends up showing.

flat-folding · Two-colourability a disc, with a vertexa ring, with noneone interior vertex, 3 creases at itodd degree, so they do notno interior vertices at alland the panels still do notboth refuse: two routes round the sheet leave a panel 1.87 sheet-widths apart

Even is not enough

Every vertex theorem in the subject is a statement about one point, and the two-colouring of the panels looks like the exception. It is not — on a square of paper it is a parity at each vertex and nothing more. Cut a hole and the two come apart: a loop of paper with three creases has no interior vertices at all, satisfies every theorem there is, and cannot be folded flat.

flat-folding · Two-colourability 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

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.

flat-folding · As drawn the bar is how far apart two routes to one panel end up, before the cut3 creases1.751.75 apart · cut open, 0e+05 creases1.591.59 apart · cut open, 0e+07 creases1.431.43 apart · cut open, 0e+09 creases1.321.32 apart · cut open, 0e+011 creases1.241.24 apart · cut open, 0e+0after one cut from the hole to the rim, every one of them places to rounding — with no crease changed

A cut that reaches the edge

A ring of paper with three creases running from its hole to its rim satisfies every condition the subject has — vacuously, because it has no interior vertex at all — and cannot be folded: its panels take no two colours and the two routes to one of them end up 1.75 sheet widths apart. One cut from the hole to the edge, crossing no crease and changing no letter, and it folds exactly. The cut removes an adjacency, which is the one thing neither a fold nor an edge can do.

material · Kirigami 34560%20%40%60%80%100%creases in the stripreachable by simple folds72%30%17%13%the basic symbolsa dashed line — valleya dotted line — mountainan arrow — fold it nowand what they missreverse, squash, sink,petal — every one of thema move no dashed linecan ask forevery assignment of 68 seeded spacings

A file has no paper

The field's interchange format is three arrays — where the vertices are, which pairs of them an edge joins, and a letter for each edge — and that is exactly the object every computation on a crease pattern starts from. A list of edges cannot say that two of them must not cross, because crossing is a property of the drawing and the list has no drawing in it. So a pattern that no paper could carry is a perfectly well-formed file, and four of this collection's own were.

history · Notation the bar is how many circles of that many panels were found726 circles, from 6 panels to 32, over every pattern family measured here4 panels0round one vertex — Maekawa forbids it5 panels0odd — the two-colouring forbids it6 panels21129.1% of the circles measured7 panels0odd — the two-colouring forbids it8 panels21129.1% of the circles measured9 panels0odd — the two-colouring forbids it10 panels8211.3% of the circles measured11 panels0odd — the two-colouring forbids it12 panels9513.1% of the circles measured13 panels0odd — the two-colouring forbids it14 panels304.1% of the circles measured15 panels0odd — the two-colouring forbids it16 panels314.3% of the circles measured17 panels0odd — the two-colouring forbids it18 panels172.3% of the circles measured19 panels0odd — the two-colouring forbids it20 panels141.9% of the circles measured22 panels81.1% of the circles measured24 panels152.1% of the circles measured26 panels71.0% of the circles measured28 panels20.3% of the circles measured30 panels20.3% of the circles measured32 panels10.1% of the circles measuredthe empty rows are not rare cases — they are lengths that cannot occur, and each has its own reason

A contradiction is even

A crease pattern's letters can demand a circle of panels each of which lies below the next, which is a proof that the sheet has no folded state. Every such circle found here — one thousand one hundred and forty-nine of them, across every family of patterns this collection draws — has an even number of panels in it, and none has four. Both facts are theorems rather than observations, and they come from opposite ends of the subject.

flat-folding · Two-colourability the Yoshimura, 2×2 cellsone drawing, four sheetscutoutgluedacrossgluedalonggluedboth waysvertices8888free letters36283224panels29202416V − E + F1000the vertex row is the control: identifying edges can neither make nor destroy a vertexand Euler's number is the cheapest check that the gluing did what it says

Euler counts the gluing

Vertices minus creases plus panels comes to one on a rectangle of paper and nought on any gluing of it. That is the cheapest check that an identification did what it says, it costs three counts already being made, and it is what found a crease running exactly through the corner of a cell — a case the corner search could not see and no other check would have noticed.

flat-folding · Boundary ruling out the square cell's loops, one direction at a timewhat is left splits248 arcs go, 24 remaindirection (1, 0)102 arcs go, 10 remainwhat is left splits010 arcs go, 0 remaindirection (-1, 0)102 arcs go, 10 remainwhat is left splits010 arcs go, 0 remainthe bar is how many arcs are still in play after the step

The arc that arrived twice

Which of two panels a crease calls its near one is decided by the order a face walk happened to number them, and the mirrored record is the same relation. Except on one sheet, where it is not — and that sheet turned out to be the one whose folded state comes back the other way up, which is how a duplicate in a graph became a diagnosis.

flat-folding · Layer multiplicity

Named alongside it

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

Necessary conditionFolded stateMaekawa's theoremPanelTwo-colourabilityBoundaryBoundary vertexCrease assignmentCrease patternCrossingFlat-foldabilityGluing

All concepts