Machine Kinematics
solved, then drawn
Concept

Kinematic chain — where it appears

A set of links joined by joints, considered without any lengths: a graph, a vertex per link and an edge per joint. Four conditions make one — simple, connected, no link carrying fewer than two joints, and no proper subchain whose own mobility count is nought or less. Its mobility belongs to the chain rather than to any mechanism made from it.

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

A four-bar at 60°, solved. Ground 4, crank 1, coupler 3.5, rocker 3. Every joint position here is the output of a Newton–Raphson solve on the loop-closure equations, converged to 0.0e+0 — not a placement that looked right. Grashof's condition classifies these lengths as a crank rocker, and sweeping the crank through 360° confirms it: 120 of 120 positions assemble. The transmission angle at this instant is 66.9°.

Four bars and four pins

The smallest interesting machine there is. Four lengths decide everything about it — which link can turn all the way round, how hard it pushes, where it stops and whether it can be assembled at all — and every one of those is a number that falls out of a solve rather than a judgement about a drawing.

linkages · Fourbar One, two, sixteen, two hundred and thirty. Every planar chain of mobility one, up to ten links, counted by enumeration rather than quoted. The pins column is forced: a chain of 10 links has one degree of freedom only if it has exactly (3n − 4)/2 pins, which is why no odd link count appears. Pass the count is how many graphs satisfy Grübler's rule, are connected, are simple and give every link at least two pins. Are chains is how many of those survive the fourth condition, that no proper subchain is already a structure — and the gap between the two columns is the whole of this field's first argument: at ten links 1,878 graphs pass a rule that 230 of them deserve. Mechanisms is larger again, because a chain is not a mechanism until a link is held still, and how many different mechanisms that gives is a question about the chain's own symmetry.

The mechanism is the graph

Twenty-one fields of this site have been handed a mechanism and asked what it does. Take the mechanism away and keep only which link is pinned to which, and there is still a finite list of answers: one chain of four links, two of six, sixteen of eight, two hundred and thirty of ten — and 1,878 graphs at ten links that pass every count and are not among them.

topology · Topology Same links, same pins, different chains. Watt chain on the left and Stephenson chain on the right. They have the same number of links, the same number of pins and the same assortment — 4×2 + 2×3 — so no count of anything can tell them apart. What differs is where the pins go: on the left the two ternary links share a pin, on the right they do not, and that single fact makes two mechanisms with different coupler curves, different numbers of inversions and different position problems. It is the smallest case in the subject of the thing this field exists to say: the arithmetic is a filter and the graph is the answer.

Same links, same pins, different machines

Watt's six-bar and Stephenson's have six links, seven pins, four binary links and two ternary ones. Every count anybody can make on them agrees. They are different chains, they give two mechanisms and three, and the difference is whether the two ternary links share a pin.

topology · Topology Three verdicts, and only one instrument can give all three. Every 10-link graph that satisfies Grübler's count, split by what is actually true of it. 230 are mechanisms with 10 links. 1,165 carry a subchain whose own count is exactly nought — and neither of the two standing routes can see them: the count returns one and the rank returns one, and both are right, because a rigid subchain removes exactly the freedoms it is supposed to. What is false is the description. 483 carry a subchain whose count is below nought, and those the rank does catch: the surplus pins repeat a constraint already imposed, the Jacobian loses rank, and the measured mobility comes out above the count. The third instrument — a count run over every subset of the links — is the only one that answers the question at all.

What a count cannot see

At ten links, 1,878 graphs satisfy Grübler's rule and 230 are mechanisms. The other 1,648 contain a subchain that is already a structure — and on 1,165 of them the count says one degree of freedom, the rank of the constraint Jacobian says one degree of freedom, and both are right about a mechanism that does not have ten links.

topology · Topology Different numbers of ternary links, and the same spectrum. Two of the 230 ten-link chains whose adjacency matrices have identical characteristic polynomials — identical in every one of the eleven coefficients — and which are not the same chain. They do not even share their assortment — 6×2 + 2×3 + 2×4 on the left and 4×2 + 6×3 on the right. Counting the ternary links tells them apart and the spectrum does not. That is worth pausing on: the spectrum is the more sophisticated invariant, it is the one that got written into the literature as a test, and here it is beaten by the first thing anybody would try. The polynomial both of them have is λ^10 − 13λ^8 + 52λ^6 − 4λ^5 − 76λ^4 + 8λ^3 + 32λ^2.

Right until the size nobody checked

The characteristic polynomial of a chain's adjacency matrix is a fingerprint that costs nothing and separates every six-link chain and every eight-link one. At ten links it fails on two pairs — and on one of them, counting the ternary links tells the two chains apart while the polynomial does not.

topology · Topology Colour by degree, recolour by neighbours' colours, stop when nothing changes. The cheap half of every isomorphism routine there is, and the half that does most of the work. Start by colouring each link with how many pins it carries. Then repeatedly recolour it with its own colour plus the multiset of its neighbours', until a pass changes nothing. On this chain the process ends with 3 classes of sizes 2, 2, 2, and two links of different colours are certainly different links — no relabelling can carry one to the other. What refinement cannot do is separate links that are alike to every local measurement, and that residue is what the backtracking search is for. It is also, exactly, why a spectral test fails: an eigenvalue is a global average over walks and has no more to say about two locally identical links than the refinement does.

Deciding that two chains are one

Two chains are the same chain when a relabelling of the links carries one to the other. Ten links admit 3,628,800 relabellings, and the census asks the question 26,335 times — so the answer is not a search but a rule that picks one labelling out of the graph itself, and asking whether the two strings match.

topology · Topology One chain, four mechanisms. The same four bars and the same four pins in every panel. What changes is which link is bolted to the bench, and that is not a property of the chain — it is a decision about where the bench is. The four mechanisms are crank rocker, double crank, crank rocker, double rocker: one input turns fully in some and rocks in others, and what each one is for is different. What cannot change is the shape of the closed loop, and the two diagonals measure that without reference to which link is held still: swept independently, all four visit the same locus of diagonal pairs to within 2.9e-3, half the sampling resolution. This is why the Whitworth quick-return and the oscillating-cylinder engine are not merely similar to a slider-crank; they are one.

One chain, four mechanisms

Which link of a four-bar is bolted to the bench is not a property of the chain. It is a decision about where the bench is, and making a different one gives a mechanism that looks and behaves completely differently while being, as a chain, the same object — which is why the Whitworth quick-return and the oscillating-cylinder engine are both a slider-crank.

linkages · Fourbar crank rocker: the closest pair at one position. The site's standard four-bar: ground 4, crank 1, coupler 3.5, rocker 3. Every joint is where the solver put it, exactly as in the linkage field; the material is the only thing added. The heavy segment joins the two closest points over every pair of parts that is tested — which excludes pairs sharing a pin, since their material surrounds that pin by construction — and its length is the gap: 0.5438 here, between coupler · frame. A negative value is a penetration depth, the distance the pair would have to be moved apart, and it is drawn in the warning colour.

Two bars that have to cross

The site's own four-bar has its coupler inside its frame by a full link width for the whole of a turn. It is not an impossible mechanism; it is a mechanism that cannot be built in one plane — and the plane it has been drawn in for twenty-three fields was a convenience nobody had to pay for.

bodies · Body The five six-bar mechanisms, and there are only two chains. Two chains and five machines. Watt's chain has two orbits of links, so grounding it gives two mechanisms; Stephenson's has three. The frame is drawn dark in each. This is the whole of what "Watt I", "Watt II", "Stephenson I, II and III" name — not five linkages somebody invented, but two graphs and the five genuinely different links there are to bolt down. Anyone who has met the names as a list of five things has met the answer without the question, and the question is a count of orbits.

Which link to bolt down

A chain is not a machine until one of its links is held still, and which one is a decision. Two links give the same machine exactly when a relabelling of the whole chain carries one to the other — so the number of mechanisms a chain gives is a count of orbits, and the classical five six-bars and seventy-one eight-bars are that count.

topology · Topology 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 Four of the sixteen cannot be positioned without a solver. For every chain, every way of choosing a frame and a driven link pinned to it, and for each the decomposition into Assur groups. All dyads counts the choices whose groups are all two links — those are the mechanisms a draughtsman can position with a compass, two circles at a time. The last column is the one that matters: chains for which no choice of frame and input is all dyads, so every way of driving them leaves a group of four or more links that has to be solved as a single system. At eight links there are 4 of them and at ten there are 90. This site has run a Newton solve on every mechanism it has ever drawn, and it has always been possible to read that as convenience. On these it is not.

Eight ways to drive it, and one machine

Bolting a link down is half the decision; the other half is which link carries the input. A four-bar has eight frame-and-input pairs and exactly one of them is a distinct machine — and across the eight-link census 320 listed pairs collapse to 153.

topology · Topology Watt's chain. Six links and 7 pin joints, so Grübler counts 3(6 − 1) − 2(7) = 1 and the rank of the Jacobian measures 1. Two of the six links must carry three joints; they are shaded. Here they share a joint, which makes this a Watt chain. That adjacency is the entire classification, and it is read off the graph rather than off the picture.

Six bars, and what the extra dyad buys

Every linkage so far has had four bars, because four is the smallest closed chain that moves. The next one up is six, not five, and six is where the subject stops being one family and becomes a taxonomy — two chains, distinguished entirely by whether the two links carrying three joints happen to touch.

linkages · Synthesis Two circles each, so two to the power of the dyads. A dyad has two solutions, and a chain whose groups are all dyads is solved one dyad at a time, so the number of ways it can be assembled at a given input angle is 2 raised to the number of them. That is a prediction made from the graph about a count of configurations, and it is checked here against a count: the same chain solved from 240 random seeds, with the distinct converged configurations counted. The two agree in every row. Watt's did not at first — it came back at eight — and every one of the four extra answers had its ternary link mirrored: three distances fix a triangle only up to reflection, so the distance equations admit a part that has been turned inside out. A reflected link is a different part rather than a different pose, and the solver refuses those frames now.

Two to the power of the dyads

How many ways a mechanism can be assembled at a given input angle is a count of configurations, and it is predicted here by a graph: two circles per pair of links, so two to the power of the number of pairs. The prediction came back four for Watt's chain and the count came back eight, and the four extra had a link turned inside out.

algebra · Algebra A dyad is two circles, and that is why it has two answers. The whole of what makes a dyad easy. Two links, three pins: one pin onto something already placed at each end, one pin between them. The free pin is at a fixed distance from each of the placed ones, so it lies on both circles — and two circles meet in two points, in nought, or in one. That is a quadratic with a closed form, and its two roots are the two assembly branches every four-bar on this site has. A group of four links has no such picture: its unknowns do not separate into one circle each, the system does not factor, and what replaces the compass is Newton's method from a seed. positioned by solving, not by drawing.

What has to be solved together

Hold a link, turn a neighbour, and the rest of a mechanism comes apart into the smallest sets that can be positioned one after another. Every set of two links is two circles meeting — a quadratic, two branches, no solver. A set of four is a system, and this site's Newton solve stops being a convenience.

topology · Topology The four eight-link chains a compass cannot position. Every one of the twenty ways of choosing a frame and a driven link, on each of these four chains, leaves a group of four links or more that has to be solved as one system. There is no order in which they come apart two at a time, so there is no ruler-and-compass construction for any of them and no closed form for their positions. They are numbers 1, 3, 4, 10 of the sixteen, and they do not share an assortment: 4×2 + 4×3 and 5×2 + 2×3 + 1×4 both appear. Three of the four are among the most symmetric chains in the census — automorphism groups of 16, 8, 8 against a median of three across the sixteen — which is the direction one would guess, since a symmetric chain has few genuinely different places to attach a driven link. The fourth has an automorphism group of 2, so symmetry is a tendency here and not the reason.

Four that a compass cannot reach

Twelve of the sixteen eight-link chains can be positioned two links at a time, from at least one choice of frame and input. Four cannot be positioned that way from any of their twenty choices — and at ten links ninety of the two hundred and thirty are in the same position.

topology · Topology What each instrument returns, on each kind of graph. The 8-link census, three rows, and the same three questions asked of every graph in it. Grübler returns 1 in every row — it has to, because that is what the census selected on. The rank returns 1 in the first two rows and 2 in the third. Only the third column changes across all three rows, and it is the one this site did not have before this field: a mobility computed for every subset of the links rather than for the whole. Read down the middle two columns and the site's standing pair of routes is unanimous about 62 graphs, of which only 16 are what it says they are.

The count was right and the name was wrong

The constraint field has checked Grübler's count against a Jacobian rank since the foundation, and the two disagree only where the geometry is special. Here is an assembly where they agree, where both are correct, and where the mechanism does not have the number of links it is described as having.

constraint · Mobility 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 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.

Choosing the chain before the lengths

Every synthesis method on this site starts by assuming a topology, and the assumption is usually a habit. What the graph fixes before any dimension is chosen is the number of free parameters — two per pin less four — and therefore how many positions can be prescribed at all.

synthesis · Synthesis 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 In space the arithmetic allows almost nothing. A body in space has six freedoms and a revolute joint takes five, so a mobility of one needs (6n − 7)/5 joints — and that is an integer only when the link count leaves a remainder of two on division by five. The whole table is this: 7, 12, 17, 22 links, and nothing else. At seven links the degrees must sum to fourteen across seven links with none below two, so every link is binary and the graph is a single seven-cycle: there is exactly one spatial chain, and it is a loop. That is the census explanation for something the spatial field has lived with since it was written — every spatial mechanism on this site is one closed loop — and it had never been stated as a count. The next admissible size is twelve links and thirteen joints, where two assortments are arithmetically possible, 157 candidates give 33 graphs, and 5 of them are chains — every one with ten binary links and two ternary, so the assortment with a quaternary link is empty exactly as four of the planar ones are.

In space there is one chain

A body in space has six freedoms and a revolute joint takes five, so a mobility of one needs (6n−7)/5 joints — an integer only when the link count leaves a remainder of two on division by five. At seven links every link is binary, the graph is a single seven-cycle, and there is exactly one spatial chain.

spatial · Spatial 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 One, two, sixteen, two hundred and thirty. Every planar chain of mobility one, up to ten links, counted by enumeration rather than quoted. The pins column is forced: a chain of 10 links has one degree of freedom only if it has exactly (3n − 4)/2 pins, which is why no odd link count appears. Pass the count is how many graphs satisfy Grübler's rule, are connected, are simple and give every link at least two pins. Are chains is how many of those survive the fourth condition, that no proper subchain is already a structure — and the gap between the two columns is the whole of this field's first argument: at ten links 1,878 graphs pass a rule that 230 of them deserve. Mechanisms is larger again, because a chain is not a mechanism until a link is held still, and how many different mechanisms that gives is a question about the chain's own symmetry.

Six things a chain is not

A count read as a verdict, a rank trusted where it is blind, a fingerprint used as a proof, a list of five taken for a complete one, a solver treated as a convenience, and a census read as a catalogue of machines. Six claims, each with the number that kills it.

wrong · Misconception How far the driven link turns is a fact about the lengths, not the chain. Each of the sixteen eight-link chains, given the arbitrary placement its own layout produces, driven from its first available choice of frame and input, and swept until a frame stops closing. 10 of the sixteen reach every angle and the rest rock through between 107° and 244°. Nothing in this chart is a property of the chains. Change the placement and the bars change; the census above them does not. It is here because it is the sharpest way to say what this field does and does not decide, and because the temptation to read a topology census as a catalogue of machines is exactly the mistake it prevents.

The chain has no lengths

Every number in this field survives multiplying every link by a different scale factor, because there are no lengths to scale. Which is also the statement of what a census cannot decide — and the sixteen eight-link chains, each given one arbitrary set of dimensions and driven, produce a chart in which nothing belongs to the chains.

topology · Topology A machine with one thing in it that must be solved at once. Each compiled machine's joints, walked in the order they can be placed: a joint goes down as soon as two things already placed decide where it is. Every one of these machines unwinds completely, and each contains exactly one pair that has to be solved together — the arm and the parallelogram that carries its second angle back to the pivot. Nothing larger than a dyad appears in a machine of two hundred and forty joints. The topology field's four-bar, at four, has no such decomposition at all; a compiled linkage is enormous and structurally trivial, which are not the same axis.

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.

topology · Topology The chain's whole configuration space, drawn on its two angles. A slider-crank asks one thing of its two angles: a cos θ + b cos φ = e, with θ the crank's angle and φ the rod's. Each panel is the square of those two angles from −π to π, with the curve that equation cuts out, followed by arclength on the equation alone. The number under each panel is how many whole turns θ, φ and φ − θ make around a circuit. A curve that crosses the square from side to side carries a turn in that angle; a closed loop inside the square carries none. The two regions where a member turns have two circuits each and the two where none does have one, which is what the four-bar regions these came from predict.

Three rotations, and four benches

The slider-crank chain's four inversions are four famous machines, and they are not four classifications. Four links make six pairs, one of those pairs cannot rotate at all because a slide is a rotation of nought, and the five that are left are three quantities between them. So an inversion chooses which two of the chain's three rotations sit at its bench, and the four regions of length space already say what all three do.

linkages · Fourbar Watt chain: 7 pins, and nothing else. A kinematic chain drawn as what it is — a graph. Each disc is a link and carries its number; each line is a pin joining two links. There are no lengths here, no angles and no positions, and every quantity this field computes survives moving any disc anywhere: the picture is a way of reading the graph and not a picture of a machine. The fill says how many pins a link carries — 4 binary, 2 ternary — which is the coarsest thing that can tell two chains apart and the first column of every census table. The count reads two numbers off this picture and nothing else: 6 links and 7 pins give 3 × 5 − 2 × 7 = 1.

A graph has no numbers at all

Every other field on this site has parameters a measurement could try to recover. This one has none. A chain is a graph, a graph is a set of links and a set of joints, and there is nothing about it that a scaling touches, a tolerance perturbs or an instrument determines.

topology · Topology The chains that never close, counted by the same routine. An open chain has one joint fewer than it has links, so its graph is a tree and its mobility is the joint count rather than one. Feeding the same enumerator that produced the closed-chain census — with the minimum-degree condition relaxed to one, because an arm's base and its end each carry a single joint — gives 1, 2, 3, 6, 11, 23, 47, 106 for three links up to ten. That is the number of unlabelled trees, a sequence anybody can look up, and reproducing it is the strongest check the enumerator gets: it was written for a different problem, tested against three mechanism counts, and asked here for a number from a different subject entirely.

An arm is a tree

The serial field's chains are the ones that never close, and as graphs they are trees. There are 106 distinct arrangements of ten links joined that way, and exactly one of them is the straight arm every essay in the field has drawn — the other 105 branch.

serial · Serial One link, five bodies. Five bars with the same two pins, offset by -0.24, -0.12, 0, 0.12, 0.24 of the link's length, drawn to a common scale. Every one of them holds its two pins exactly the same distance apart, so every one of them is the same link: put any of them into a mechanism and the mechanism solves to the same joint positions at every configuration. Nothing in the kinematics of this collection — no loop equation, no velocity, no coupler curve, no mobility count — can tell them apart. What they do not have in common is which ground they occupy on the way from one pin to the other.

A link may be bent

A link is two pins at a fixed distance and the metal between them is a free choice. Bending it moves no joint of the mechanism by more than 10⁻¹³ and moves the clearance by a tenth of a link length — enough to build a machine that a straight bar refuses, and worth exactly nothing against a bearing pedestal the link sweeps over.

bodies · Body Watt chain with 1 slide: 3 chains, 11 mechanisms. The same 6 links and 7 joints with 1 of the joints made a slide instead of a pin, drawn as a block astride the line. There are 7 ways to choose the joint, and the chain's 4 symmetries fold them into 3 that are genuinely different: with the slide at 0–3, 2 mechanisms; with the slide at 0–1, 6 mechanisms; with the slide at 1–2, 3 mechanisms. The mechanism count is the number of orbits of a held link and the slide set together, so a slide breaks symmetry the pin-only chain had, and links that gave one machine between them give two. The pin-only chain gave 2; one slide gives 11.

A slide turns nothing

Make one joint of a chain a slide instead of a pin and the graph has a second decision in it before any length exists. The symmetries that counted mechanisms count these too — Watt's chain with one slide is three chains and eleven machines — and two facts read off the graph say which placements still work: a loop of slides alone is freer than the count, and a pin in a group of links the slides hold at one orientation cannot turn. Across 102 placements on the three smallest chains, both agree with the rank of the constraint Jacobian.

topology · Topology The same links and pins, and between 12 and 15 link lengths in the stack-up. Every closed loop in a mechanism is one equation a tolerance analysis has to satisfy, and the equation involves every link the loop passes through. All 16 chains here have the same number of independent loops — 3, which is pins minus links plus one and is fixed by the two totals — but not the same shortest set of them. The bars are the total length of a minimum cycle basis, and they run from 12 to 15. So the smallest number of link dimensions that any stack-up on this mechanism can involve is decided by the graph, before a single dimension has been chosen, and two topologies a count cannot tell apart differ by 3 of them.

Where the shortest loops are

A tolerance stack-up goes round a loop, and every link the loop passes through is a dimension in it. Two eight-link chains with the same links, the same pins and the same number of loops can need twelve link lengths in their shortest independent set or fifteen — decided by the graph, before any dimension is chosen.

practice · Tolerance

Named alongside it

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

Type synthesisMobilityCanonical formInversionLink assortmentAssur groupDegenerate chainGraph isomorphismLoop closureAutomorphismConstraintDegrees of freedom

All concepts