Self-contact — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
An order with no least element
Enumerating every way a folded pattern can be stacked works by building upward from a panel with nothing below it. The smallest square twist patch has exactly one such stacking and takes eleven thousand steps to find it. The pattern that patch was cut from has no panel with nothing below it at all, so the enumeration has nothing to start from — and the sheet is perfectly well stacked anyway.
Two panels that are one panel
Paper cannot pass through paper, and every test for it compares pairs of panels. On a glued sheet two pieces of the drawing can be the same piece of paper — so a test that does not know the identification either reports a collision between a panel and itself, or misses one where the sheet meets itself round the loop.
Named alongside it
The objects these essays reach for when they reach for this one.
BoundaryLayer orderPanelConstraintExhaustive searchGluingLayer countLayer orderingNon-crossing conditionPeriodicitySelf-intersectionStacking