Graph — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
A machine with one dyad in it
Two hundred and forty joints, and two hundred and thirty-eight of them can be placed one at a time from parts already positioned. The whole of what has to be solved simultaneously is a single pair — the arm and the parallelogram carrying its second angle home. Size and structural depth are different axes, and a compiled machine is extreme on one and trivial on the other.
A contact turns and slides at once
A cam on its follower, a gear tooth or a pin in a slot takes one freedom away where a pin or a slide takes two, and it turns as well as slides. Give every joint of the four-bar, Watt's and Stephenson's chains a third label and there are 1,317 different chains. The rule that read slides off the graph extends to all of them, agreeing with the constraint rank on every one, and the two obvious shortcuts miss 36 and 769. What the graph cannot record is which way a contact's normal points — and on these chains that never matters, while a single stop added to a four-bar holds everywhere except through one point.
Named alongside it
The objects these essays reach for when they reach for this one.
Kinematic chainAssur groupCompiled linkageConstraint rankConstruction orderContact normalDeterminacyDyadGrübler's criterionHigher pairInstant centreLever arm