Machine Kinematics
solved, then drawn
Concept

Rigid origami — where it appears

The folding of a crease pattern with every panel flat and every crease a straight hinge, so that the sheet is a mechanism rather than a bending surface. The unknowns are the fold angles, one per interior crease, and the constraints are one closure per interior vertex — which makes a folded pattern a network of spherical linkages sharing their joints.

Named by 6 essays across one field — each of them below, with the objects they name alongside it.

Six assemblies, one routine, three disagreements and one accident. Every row is the same three steps: write down the constraint Jacobian, take its rank, and subtract it from the number of unknowns. The representations differ — bars between points, bodies joined by pins, panels joined by creases, one cell of a pattern that repeats for ever — and the routine does not. The counted column is the arithmetic on the numbers of bodies and joints; the measured column is the nullity of the matrix. They agree on the lazy tong and on the kagome cell and disagree on the other four, most sharply on the deployable ring, which the count declares immobile and which is sold as a mechanism that opens. The right-hand column is the reason: constraints that repeat what another constraint has already said, which the count has no way of seeing and the rank cannot help seeing. The fourth row is worth reading twice: the count says nothing can move and nothing can, so the two agree — and they agree for the wrong reason, because that pattern's flat state shows four freedoms and not one of them is a motion.

Many loops, one freedom

A scissor lift, a folded sheet and a deployable ring are one small unit repeated thirty times, and three things change at once: the count of bodies becomes a parameter, mobility becomes the rank of a matrix, and a unit that moves can be rigid the moment it is joined to another of itself.

networks · Network What a pattern that cannot fold leaves behind. The best a least-squares solve can do with the vertex closures, against the fold it is asked for. The Miura pattern closes at every angle, at the arithmetic's own floor — the line along the bottom is 10⁻¹⁵ and below. The same grid with its vertices moved by a tenth of a panel does not close at any angle at all: its residual starts at 5.9e-6 at the smallest fold and grows with it, and no seed and no number of iterations moves it. Both patterns have the same panels, the same creases, the same graph and the same developable vertices, and every one of those vertices folds perfectly well on its own.

Each one moves, and together they do not

Take the pattern a Miura sheet folds along and move every interior vertex by a tenth of a panel. Every vertex still folds on its own — each is a spherical four-bar with a freedom of its own — and the four of them together fold to no angle at all, with a residual that starts at six millionths and never falls.

networks · Network Six sizes, one freedom, and a count going the other way. Creases and constraints both grow as the square of the sheet's side, and they grow at different rates: two per panel against three per interior vertex. So the counted column runs (n − 1)(3 − n) and is positive at two, nought at three and increasingly negative after that, while the measured mobility is one on every row. The redundant column is the difference and it is exactly (n − 2)² — one at three, four at four, nine at five, thirty-six at eight. A twelve-by-twelve sheet of a hundred and forty-four panels is counted at minus ninety-nine and has a hundred repeated constraints, and it is the same mechanism as the smallest one on this table.

The freedom that survives repetition

A Miura sheet has one freedom at four panels and one at a hundred and forty-four, and the count runs the other way: plus one, then nought, then minus three, minus fifteen, minus ninety-nine. The gap between them is exactly (n − 2) squared, which is a hundred repeated constraints on a sheet with one degree of freedom.

networks · Network A vertex is a spherical linkage, and the sectors are its link lengths. The four creases of one folded vertex, drawn as directions from the vertex itself, with the great-circle arcs between consecutive ones. Those arcs are the sector angles of the flat pattern — 80°, 60°, 100°, 120° — and they are those angles at every fold, to 8.9e-16 radians. That is the whole of the claim in the title: four axes through a point at fixed arcs from each other is a spherical four-bar, the object this site's spatial field built two phases ago, and a crease pattern's vertex is one of them with the arcs printed on the paper. The dihedral angle of the sheet at each crease is a half turn less that crease's fold angle, which here run 68.8°, 14.4°, 68.8°, 14.4°. positioned by solving, not by drawing.

Every vertex is a spherical linkage

Four creases through a point at fixed arcs from one another is a spherical four-bar — the object the spatial field is built on — with its link lengths printed on the paper as sector angles. The arcs hold to four parts in ten thousand million million at every fold, and on a flat-foldable vertex the half-angle tangents keep a ratio constant to nine figures.

networks · Network Two branches, meeting where the sheet is flat. The same vertex's two folding modes, plotted as one crease's fold angle against another's. Both curves pass through the origin, which is the flat sheet, and they cross there and nowhere else. That crossing is what a rank cannot see: at the origin the tangent directions of both branches are available to the constraint matrix at once, so the nullity there counts them all and the mechanism has only one of them once it has left. Every branch argument this site has made — a four-bar's assembly configurations, an arm's eight postures, the components a solve's paths turned out to run between — is this picture with different axes.

Where the branches meet

A flat sheet is the one configuration every folding of a pattern passes through, and it is the one configuration where the rank is wrong about all of them. Three of a three-by-three Miura sheet's four apparent freedoms are not motions — and a grid that folds to no angle at all reports exactly the same four.

networks · Network What the repeated constraints cost the drawing. Move an interior vertex of the flat pattern and the folded state generally stops existing. It survives if the change to the vertex closures can be absorbed by a change in the fold angles — and the part that cannot be absorbed is exactly the part that lies along a dependency, because a dependency is a direction in residual space the fold angles cannot reach. So the number of conditions a pattern's shape has to satisfy is at most the number of dependencies among its constraints, and on the Miura family it is exactly that: one at three by three, four at four, nine at five, measured by taking the rank of the obstruction. A twelve-by-twelve sheet has a hundred conditions on where its vertices may be. That is why a grid whose vertices are anywhere at all does not fold, and it is the same number, read the other way round, as the amount by which the count is wrong.

What a pattern has to satisfy

Move an interior vertex of a crease pattern and the folded state generally stops existing. How many conditions the drawing has to meet is not a matter of taste: it is exactly the number of dependencies among the constraints, measured at one, four and nine on three sizes of sheet, and a hundred on a sheet of a hundred and forty-four panels.

networks · Network

Named alongside it

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

NetworkMobilityCrease patternRankRedundant constraintNull spaceAssembly branchConstraint jacobianDevelopabilityGrübler's criterionSpherical linkageBifurcation

All concepts