Machine Kinematics
solved, then drawn
Concept

Enumeration — where it appears

A count obtained by listing every candidate and testing each one, rather than by a formula. It is the honest answer when a formula would have to be trusted, and it is what this site uses whenever the candidates are countable and the count is what is claimed.

Named by 16 essays across 10 fields — each of them below, with the objects they name alongside it.

How far inside the hull the origin actually is. The same seven arrangements with their margins drawn rather than tabulated, because the shape of this chart is the argument: the quantity is not a probability and not a percentage, it is a distance — how far the origin sits from the nearest face of the hull of the contact rows, with every row a unit vector so the number is comparable across arrangements. The two that hold come in at 0.211 and 0.091; the five that do not come in at exactly nought, and they are drawn at nought rather than left off. A margin that falls smoothly to nothing is what makes this a measurement: an arrangement approaching one that lets go says so before it does.

The test is a program, not a rank

Three independent routes to one yes-or-no: enumerate the escape cone's extreme rays by cross products, take the convex hull of the contact rows and ask where the origin is, or hand the whole thing to a simplex. They agree on every arrangement — and the first version of the third one reported a disc as held, which is the one part in the field that no number of contacts holds.

holding · Restraint 4 contacts, and the centres they still allow. The same four, placed pinwheel. The same square, the same four edges, the same distance along each — and taken the same way round rather than alternately. Every row's moment then has the same sign, so no positive combination can cancel it, and the part turns. Each contact contributes one half-plane of permitted centres per sense, and the shaded regions are what survives all 4 of them: the darker one is where an anticlockwise rotation is still permitted and the lighter one where a clockwise one is. What is left is the escape, and it is a region rather than a direction: any point inside it will do as a centre. The enumeration finds 4 extreme rays, of which 4 are rotations and the rest are translations — the corners of the region and its unbounded directions respectively. positioned by solving, not by drawing.

The escape is a place

A part that is not held escapes, and the useful thing is not that it escapes but where. The extreme rays of the cone are the corners of a region of the plane and its unbounded directions are translations — so the answer to 'this does not hold' is a picture with a shape, and the shape says where the next contact has to go.

holding · Restraint Six gearsets, three conditions. Every one of these can be drawn, and five of the six are drawn in some textbook or other. The columns are the three conditions a planetary has to satisfy: that a whole planet fits between the sun and the ring, that the sun and ring teeth add to a multiple of the planet count, and that the planets clear each other. The last column is how far out of mesh the worst planet station is, in teeth — a quantity that is zero or is not, and that no drawing shows, because a drawing of a planetary at this scale draws circles.

The gearset that could not be assembled

A planetary drawing shows a sun, a ring and three or four planets between them, and if the circles are the right sizes at the right stations it looks right. The condition that decides whether the second planet can actually be dropped in is arithmetic — the sun and ring teeth must add to a multiple of the planet count — and it appears in no drawing, at no scale, in any style.

wrong · Misconception A colouring is not an assignment. A pin joining links in planes 1 and 3 has to pass through plane 2, and anything in plane 2 whose material covers that pin is pierced by it. That condition involves three links at once where a colouring's conditions involve two, and it is invisible to a colouring because permuting colours preserves a colouring and destroys betweenness. It does not change the number of planes on any machine here. What it removes is arrangements: of the 6 three-plane colourings of a crank rocker, 2 can be built, and of Peaucellier's 192 exactly 96 can.

A plane is a colour

Assigning links to parallel planes so that no two conflicting parts share one is a graph colouring, and the answer for a four-bar is three. Then the pins have to get through, and the problem stops being a colouring: of the six proper three-plane colourings, two can be built.

bodies · Body A joint with no way out in the plane it is drawn in. A dovetail. The tail is wider at its far end than at the mouth it went in through, so every direction out of the mouth is blocked by a slanted face and every direction further in is blocked by the floor. In the plane of this drawing the joint cannot be taken apart at all, and the direction it does come apart in is the one the drawing does not show. The moving part touches the rest at 3 faces, each contributing one inequality on the direction it may be translated in — the direction must not have a negative component along that face's inward normal — and the set of directions that satisfy all of them is a cone in two dimensions rather than three, because a translation has no moment term. That is why a removal cone can be drawn as an angle where a mobility cone cannot. Here it is empty: every direction is refused by one face or another, so the part cannot be taken out by any translation and cannot have been put in by one either. That is a statement about the assembly and not about the part, and the direction the joint does come apart in is perpendicular to this drawing. positioned by solving, not by drawing.

Which way it comes out

Drop the rotation from the inequalities and the cone lives in two dimensions rather than three, so it can be drawn as an angle: a block in a vee has ninety degrees of directions out, a key in a slot has exactly one and no arc around it, and a dovetail has none at all. Three answers, and each of them is a different kind of joint.

holding · Restraint Neither one comes out, and the two of them do. Two congruent Z-shaped parts in a tray that is open at the top. Each has a step that lies over the other's, so part A's four contacts with part B have normals at all four points of the compass and leave it no free direction at all — and the same is true of B, for the same reason and by symmetry. The blocking is mutual and there is no order in which the two can be taken out one at a time. Together they have 6 contacts, all of them with the tray, and exactly one direction out: straight up. So the removal cone of a set of parts is not built from the removal cones of its members, and which part comes out first is a question with no answer here. positioned by solving, not by drawing.

Neither part comes out first

Two congruent Z-shaped pieces in a tray open at the top. Each has four contacts with the other, with normals at all four points of the compass, so each alone is blocked in every direction there is — and the pair lifts straight out. The removal cone of a set of parts is not built from the removal cones of its members, and *which part comes out first* is a question with no answer.

holding · Restraint The search generates 3,000 candidates for 1,878 answers. How much work the enumeration does, against how much it has to show for it. The upper line is the number of complete labelled graphs the search reaches and the lower is the number of distinct graphs they turn out to be, so the vertical gap is waste — every candidate above the lower line is a graph the search had already found under a different labelling. At eight links the unpruned version of this search generated 8,494 candidates for the same 71 answers, and at ten links it did not finish at all; with the pruning it generates 3,000 for 1,878 in 442 milliseconds. The rule that does it is one line long: when two links carry the same number of pins, reject the labelling that would be lexicographically smaller if they were swapped. It cannot reject a labelling that is the largest in its class, so nothing is lost, and it is not a complete test, which is why the canonical form is still taken at the end.

The candidates a search throws away

The obvious enumeration generates every labelling of every chain and keeps one. At eight links that is 8,494 complete graphs for 71 answers; at ten it does not finish. One rule — reject the labelling that a swap of two equal links would improve — takes it to 3,000 candidates for 1,878 answers in half a second, and twelve links is still out of reach.

topology · Topology Which teeth one tooth ever meets: 20 on 40. Follow one tooth of the pinion round and mark every wheel tooth it touches. It does not touch them all. It touches 2 of 40, which is z₂ divided by the greatest common divisor of the two counts — 20 here — and it goes on touching the same ones for as long as the gears are in mesh. The pattern repeats after 2 turns of the pinion. Adding one tooth to the pinion makes the counts coprime and takes the count from 2 to 40. The marks are produced by walking the mesh, and the count they give is compared with the gcd rather than derived from it.

Which tooth meets which

A tooth on a pinion does not meet every tooth on its wheel. It meets z₂ divided by the greatest common divisor of the two counts, and it meets the same ones for the whole life of the drive. On the default planetary used throughout — sun 24, planets 24 — a planet tooth touches exactly one sun tooth and never touches another, and nothing in the drawing says so.

gears · Tooth 11 assortments are arithmetically possible and 7 contain a mechanism. The 10-link census organised the way every published table organises it: by how many links carry two pins, three, four and more. The assortments themselves are a small piece of arithmetic — the degrees must sum to twice the pin count and none may be below two — and it admits 11 of them. 4 contain no chain at all. Each of those 4 needs a link carrying six, seven or eight pins, and a link with that many pins in a chain this small always drags a structure in with it: the graphs exist, they satisfy Grübler exactly, and every one of them has a rigid subchain. That is a result the arithmetic cannot reach, because the arithmetic never looks at where a pin goes.

Eleven assortments and four that are empty

How many links carry two pins, how many carry three, how many carry four: two lines of arithmetic admit eleven answers at ten links. Seventy-eight graphs have degrees the last four of them describe, every one of those graphs satisfies Grübler's rule exactly, and not one of them is a mechanism.

topology · Topology Two Burmester points, or none, depending where the crank is. A Burmester point's path stays on one circle to fifth order. A planar motion has at most four of them; two of this mechanism's are always its own moving pins, whose paths are exact circles and satisfy every order at once. The other two are real for 67 per cent of the turn and complex for the rest, and the count changes without anything about the mechanism changing. The window matters and is stated: points beyond a hundred coupler lengths from the pole are not counted, and widening the window from six to four hundred moves the count of positions-with-two from 191 to 245 out of 360. A silent cap here would read as an absence.

The circle a point stays on longest

One condition further on are the points whose path holds a circle to fifth order. A planar motion has at most four; two of them are always the mechanism's own pins, and the other two are real for two thirds of a turn and complex for the rest — a count that changes while nothing about the mechanism does.

curvature · Curvature Everything one planetary can do, and the gap in the middle. A single epicyclic has three shafts, so there are six ways of choosing which is held, which is driven and which comes out. Each gives a band of reductions as the tooth counts run over every design that can be cut, assembled with three planets and kept clear of undercutting. The bands above 1 are drawn; between them is a gap running from 1.6304 to 2.5862 that no single planetary reaches in any configuration — and a reduction of exactly 2, which is the most ordinary thing anybody asks a gearbox for, is inside it. The gap's width as a factor is exactly the smallest achievable ring-over-sun ratio, 1.5862, which is a statement about how small a planet may be and how large a sun may be.

The reductions a planetary cannot give

One epicyclic offers six ratios, and the formula for each of them suggests the whole positive line is available. Sweep every design that can actually be cut and assembled and the reachable set has a hole in it running from 1.630 to 2.586 — the width of which has a closed form — and a reduction of exactly 2, the most ordinary thing anybody asks a gearbox for, sits in the middle of it.

transmission · Transmission A catalogue is a search space, and a requirement is a filter on it. What a census is for. Four requirements applied in turn to the 230 ten-link chains, each of them a statement about the graph alone: a link carrying four pins, a link none of whose neighbours is binary, and a way of driving it that comes apart into dyads. 26 chains survive all of them. None of this is dimensional synthesis and none of it can be — no requirement here mentions a length, an angle or a position, and every one of them can be checked before a single dimension is chosen. That is the argument for having the census at all: the design problem is a search over shapes within a topology, and knowing which topologies there are turns an open question into 26 closed ones.

A catalogue is a search space

Dimensional synthesis searches over lengths within a topology, and the topology is chosen first — usually from memory, usually from a list of five. With a census the list is two hundred and thirty, every requirement that reads only the graph is a filter on it, and the choice stops being a habit.

topology · Topology Reverted trains of 12 : 1. A reverted train has its input and output shafts in line, which means the two stages share one centre distance — so the tooth counts must satisfy z₁ + z₂ = z₃ + z₄ and give the ratio asked for. Two equations in four integers, and there is no reason for a solution to exist. For 12 : 1 there is none at all until the wheels are allowed to reach 63 teeth; below that the coaxial condition and the ratio simply cannot both be met. This is the same kind of arithmetic as the clock trains of the timing field, with one extra equation, and the extra equation is what a shaft position costs.

Two shafts that must be in line

Asking a two-stage gear train for a ratio is easy. Asking it for a ratio and for its input and output shafts to be coaxial is asking for a solution of two equations in four integers, and there is no reason for one to exist. A twelve-to-one reverted train needs a sixty-three-tooth wheel before it has any solution at all — while sixteen to one, a larger ratio, manages with fifty-six.

transmission · Transmission One pin and two, on the same wheel. A 6-slot Geneva wheel at one instant of its index, driven by a crank carrying one pin and by the same crank carrying two. The wheel, the slots and the centre distance are identical; only the pin count differs. Each pin drives the wheel through one slot pitch while the driver sweeps 120°, so 1 pin gives 1 index a driver turn and leaves 67% of it at rest, 2 pins give 2 indexes a driver turn and leave 33% of it at rest. Nothing else about the mechanism changes, which is why the whole question is arithmetic.

Two pins and no dwell at all

Put a second pin on a Geneva's crank and the wheel indexes twice a turn instead of once, at a quarter of the acceleration for the same output rate. Put a third on a six-slot wheel and it never rests; put a third on an eight-slot wheel and two pins meet in two slots and it jams. Both of those look like separate conditions and are one, and the boundary between them is an equation in integers with exactly three solutions.

timing · Intermittent What region each four-bar's two cognates land in. One row per region of length space. Against each, the regions of the two four-bars Roberts's construction gives for the same coupler curve, and how many of the 24000 chains in the census landed in that region. Every row has one entry: across the whole census, and at each of 5 tracing points, the original's region decides its cognates' regions with nothing left over. The four Grashof regions are above the rule and the four triple rockers below it, and no row crosses it — a crank-rocker has a double rocker and a rocker-crank, a double crank has a double crank and a double crank, a rocker-crank has a rocker-crank and a double rocker, a double rocker has a crank-rocker and a crank-rocker, a 0–π rocker has a 0–π rocker and a 0–π rocker, a π–π rocker has a π–π rocker and a π–0 rocker, a π–0 rocker has a 0–0 rocker and a 0–0 rocker, a 0–0 rocker has a π–0 rocker and a π–π rocker.

The kind is decided before the lengths are

Roberts's construction hands a four-bar two others that draw its curve, and which of the eight kinds those two are is settled by the kind of the first — not by its lengths within that kind, and not by where the tracing point sits. Twenty-four thousand chains at five tracing points produce no exception, and the reason is one line: the tracing point enters the construction only as a scale, and a region is scale-blind.

curves · Coupler 5 braces, and it is rigid. A 3×3 grid of squares with 5 of its cells braced by a diagonal, and no freedom left. The bipartite graph on the 3 columns and 3 rows, with one edge per braced cell, has 1 component — and the number of freedoms is one less than that, at every bracing there is. Nothing in the rank computation knows about columns, rows or graphs.

Which diagonal rigidifies a grid

A three-by-three grid of squares needs five diagonals and eighty-one of the hundred and twenty-six ways of placing five will do. Which ones is not a rank question at all: it is whether a graph on the grid's columns and rows is connected, and eighty-one is the number of that graph's spanning trees.

networks · Network

Named alongside it

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

Design ruleForm closureKinematic chainAssembly conditionCanonical formContact normalDegenerate chainEscape coneLink assortmentMobilityType synthesisUnilateral constraint

All concepts