Machine Kinematics
solved, then drawn
Concept

Rhombus — where it appears

A closed chain of four bars all of the same length. Its far vertex is the vector sum of two equal sides, so its diagonal bisects the angle between them exactly, and holding that diagonal on a line turns the same four bars into a reflector.

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

the reflector, solved. A rhombus whose far vertex is held on a line through the pivot. One side is the input, the line is the mirror, and the other side comes out reflected in it — which is where negation, doubling and addition all come from. The relation it satisfies is (μ, θ) ↦ 2μ − θ, and across a sweep of 41 positions the worst departure from it is 1.3e-13 radians. Every joint here is the output of a Newton–Raphson solve on the bar lengths; nothing is placed by the formula the picture is about.

Four bars that add two angles

A rhombus on two links from one pivot points along the bisector of their angle, exactly, because a rhombus has equal sides. Hold its far vertex on a line and it reflects instead. From those two facts come negation, doubling and addition — and every whole-number combination of two angles a compiled machine needs.

computing · Compute What it costs to multiply an angle. Multiplying an angle by n is done by doubling and adding — 2k is one reflector applied to k, and 2k+1 is one addition of k's result and the original — so the cost follows the binary expansion of n and not n itself. Eight costs three doublings; seven costs six gadgets, twice as much, for a smaller number. The other line is what a chain of n−1 additions would cost. The difference matters because the highest multiple a curve of degree d needs is d, so the arithmetic in a compiled machine grows like d log d while the carrying grows like d⁴ — which is why the arithmetic is not what makes these machines large.

Doubling is cheaper than adding

Multiplying an angle by eight costs three gadgets and multiplying it by seven costs six. The cost of an integer multiple follows the binary expansion of the integer and not its size — which is why the arithmetic in a compiled machine grows like d log d while everything else grows like the fourth power.

computing · Compute What a singularity does, and what it does not do. The reflector driven straight through the configuration at which its two placements merge — here θ = 0.800, where the rhombus flattens onto its own mirror. Two numbers are plotted. The closure residual is how well the bars are satisfied, and it does not move: 8.3e-14 on both sides. The departure is how far the output is from the angle the gadget is supposed to produce, and it goes from the floor to order one at 0.800. Nothing breaks. The gadget goes on being a perfectly good linkage and stops being the function it was built to be.

Where the machine stops being the function

Drive a reflector through the angle at which its rhombus flattens and it comes out computing something else. Nothing breaks: every bar is the length it was, the closure residual stays at 8 × 10⁻¹⁴, and the machine goes on turning. That is why every compiled machine in this field works over an arc and not a turn — the quintic's over a tenth of a radian.

computing · Compute

Named alongside it

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

Assembly branchExact mechanismReflectionAngle bisectorAngle multiplierBinary expansionClosed formCompiled linkageContinuationFrequency pairKinematic pairLoop closure

All concepts