Crimping — where it appears
Named by 6 essays across 3 fields — each of them below, with the objects they name alongside it.
A tie is not a decision
The crimp reduction decides a vertex by folding its smallest sector away, and where two sectors tie for smallest it has no forced move and must try each of them. That search is not rare — on the vertex at the centre of the first base anybody folds it happens for fourteen of the sixteen letterings — and it has never once changed the answer.
Which vertices are the random ones
Every measurement on this site that begins 'over 373 random degree-four vertices' is a statement about a population nobody declared. There is no canonical way to pick a crease pattern at random, four defensible ways of doing it disagree about the same three questions by factors rather than by margins, and the disagreement reaches a sentence this site has published as though it were general.
Walking between two foldings
The letterings a vertex folds in are always counted and never navigated. Counting says a generic degree-six vertex has eight of them; navigating says that changing any two creases turns any one into any other, and that changing two neighbouring creases does not — and that the vertices which come apart are the ones with no coincidences in them, which is the opposite of what every other measurement here would suggest.
The creases that cannot move
One vertex's foldings are always joined up. A pattern's are not, and the number of pieces they fall into is exactly two to the power of the number of creases with an interior vertex at each end — four on a square twist, six on a hexagon twist, none at all on a preliminary base. The creases a local change cannot reach are the creases that never reach the edge of the paper.
The other grid
Box pleating is drawn at forty-five degrees, and the twenty-two-and-a-half-degree grid is usually described as the same thing done finer. It is not a refinement, it is a different alphabet: five kinds of vertex become fifty-six, and the share of letterings whose decision needs a search falls from 60 per cent to 22. A finer grid is a larger vocabulary and a less ambiguous one.
The cost is in the coincidences
How big an instance is, is what a hardness statement is about, and it is the weaker predictor of what deciding one costs. Hold the degree fixed and vary only how many of a vertex's sectors are equal: the work of deciding it rises by a factor of nearly three, against a factor of two for doubling the number of creases. The expensive instances are the ones a designer draws on a grid.
Named alongside it
The objects these essays reach for when they reach for this one.
Sector anglesThe big-little-big lemmaBox pleatingOrder typeGridLocal moveMaekawa's theoremTypical instancesBoundary vertexDecision procedureLayer orderingMeasurement