Axial polygon — where it appears
Named by 4 essays across one field — each of them below, with the objects they name alongside it.
From a packing to a crease pattern
The circles say where the flaps are. They do not say where to fold, and the step in between is a construction rather than a search — two families of crease, both determined by the packing, neither of them visible in the picture of the discs.
The last free parameter
Once the packing is fixed, one number is left in the whole design: how far a leftover polygon can be shrunk before it stops being a polygon. Everything else about the crease pattern has already been decided.
The molecule that does not exist
The universal molecule fills any convex polygon, always, which is what makes it the part of the tree method with no special cases. Hand it a reflex corner and it does not produce a worse pattern — it produces nothing, and the difficulty moves backwards to whoever chose the polygons.
The corner that splits the shrink
The universal molecule fills a convex polygon by shrinking it, and at a corner that turns back the shrink does something no convex polygon does: the region breaks in two. That event can now be computed — the skeleton of a non-convex outline is available here for the first time, and it is what lets one straight cut reach a star. It does not give the molecule back, because a molecule needs the shrinking region to stay one piece and a split is exactly the moment it stops.
Named alongside it
The objects these essays reach for when they reach for this one.
Tree methodStraight skeletonUniversal moleculeCircle packingCompletenessDesign techniqueThe fold-and-cut theoremHinge creaseInsetOptimisationPath conditionRidge crease