Structural rigidity

Last updated

Graphs are drawn as rods connected by rotating hinges. The cycle graph C4 drawn as a square can be tilted over by the blue force into a parallelogram, so it is a flexible graph. K3, drawn as a triangle, cannot be altered by any force that is applied to it, so it is a rigid graph. Structural rigidity basic examples.svg
Graphs are drawn as rods connected by rotating hinges. The cycle graph C4 drawn as a square can be tilted over by the blue force into a parallelogram, so it is a flexible graph. K3, drawn as a triangle, cannot be altered by any force that is applied to it, so it is a rigid graph.

In discrete geometry and mechanics, structural rigidity is a combinatorial theory for predicting the flexibility of ensembles formed by rigid bodies connected by flexible linkages or hinges.

Contents

Definitions

Rigidity is the property of a structure that it does not bend or flex under an applied force. The opposite of rigidity is flexibility. In structural rigidity theory, structures are formed by collections of objects that are themselves rigid bodies, often assumed to take simple geometric forms such as straight rods (line segments), with pairs of objects connected by flexible hinges. A structure is rigid if it cannot flex; that is, if there is no continuous motion of the structure that preserves the shape of its rigid components and the pattern of their connections at the hinges.

There are two essentially different kinds of rigidity. Finite or macroscopic rigidity means that the structure will not flex, fold, or bend by a positive amount. Infinitesimal rigidity means that the structure will not flex by even an amount that is too small to be detected even in theory. (Technically, that means certain differential equations have no nonzero solutions.) The importance of finite rigidity is obvious, but infinitesimal rigidity is also crucial because infinitesimal flexibility in theory corresponds to real-world minuscule flexing, and consequent deterioration of the structure.

A rigid graph is an embedding of a graph in a Euclidean space which is structurally rigid. [1] That is, a graph is rigid if the structure formed by replacing the edges by rigid rods and the vertices by flexible hinges is rigid. A graph that is not rigid is called flexible. More formally, a graph embedding is flexible if the vertices can be moved continuously, preserving the distances between adjacent vertices, with the result that the distances between some nonadjacent vertices are altered. [2] The latter condition rules out Euclidean congruences such as simple translation and rotation.

It is also possible to consider rigidity problems for graphs in which some edges represent compression elements (able to stretch to a longer length, but not to shrink to a shorter length) while other edges represent tension elements (able to shrink but not stretch). A rigid graph with edges of these types forms a mathematical model of a tensegrity structure.

Mathematics of rigidity

The Moser spindle, a rigid graph and an example of a Laman graph. Moser spindle pseudotriangulation.svg
The Moser spindle, a rigid graph and an example of a Laman graph.

The fundamental problem is how to predict the rigidity of a structure by theoretical analysis, without having to build it. Key results in this area include the following:

However, in many other simple situations it is not yet always known how to analyze the rigidity of a structure mathematically despite the existence of considerable mathematical theory.

History

One of the founders of the mathematical theory of structural rigidity was the physicist James Clerk Maxwell. The late twentieth century saw an efflorescence of the mathematical theory of rigidity, which continues in the twenty-first century.

"[A] theory of the equilibrium and deflections of frameworks subjected to the action of forces is acting on the hardnes of quality... in cases in which the framework ... is strengthened by additional connecting pieces ... in cases of three dimensions, by the regular method of equations of forces, every point would have three equations to determine its equilibrium, so as to give 3s equations between e unknown quantities, if s be the number of points and e the number of connexions[sic]. There are, however, six equations of equilibrium of the system which must be fulfilled necessarily by the forces, on account of the equality of action and reaction in each piece. Hence if e = 3s  6, the effect of any eternal force will be definite in producing tensions or pressures in the different pieces; but if e > 3s  6, these forces will be indeterminate...." [5]

See also

Notes

  1. Weisstein, Eric W. "Rigid Graph". MathWorld .
  2. Weisstein, Eric W. "Flexible Graph". MathWorld .
  3. Baglivo, Jenny A.; Graver, Jack E. (1983), "3.10 Bracing structures", Incidence and Symmetry in Design and Architecture, Cambridge Urban and Architectural Studies, Cambridge, UK: Cambridge University Press, pp. 76–87, ISBN   9780521297844
  4. Graver, Jack E. (2001), Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures, The Dolciani Mathematical Expositions, vol. 25, Washington, DC: Mathematical Association of America, ISBN   0-88385-331-0, MR   1843781 . See in particular sections 1.2 ("The grid bracing problem", pp. 4–12), 1.5 ("More about the grid problem", pp. 19–22), 2.6 ("The solution to the grid problem", pp. 50–55), and 4.4 ("Tensegrity: tension bracings", particularly pp. 158–161).
  5. Maxwell, James Cleark (1864), "On reciprocal figures and diagrams of forces", Philosophical Magazine, 4th Series, vol. 27, pp. 250–261, doi:10.1080/14786446408643663

Related Research Articles

<span class="mw-page-title-main">Three utilities problem</span> Mathematical puzzle of avoiding crossings

The classical mathematical puzzle known as the three utilities problem or sometimes water, gas and electricity asks for non-crossing connections to be drawn between three houses and three utility companies in the plane. When posing it in the early 20th century, Henry Dudeney wrote that it was already an old problem. It is an impossible puzzle: it is not possible to connect all nine lines without crossing. Versions of the problem on nonplanar surfaces such as a torus or Möbius strip, or that allow connections to pass through other houses or utilities, can be solved.

<span class="mw-page-title-main">Discrete geometry</span> Branch of geometry that studies combinatorial properties and constructive methods

Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object.

In the mathematical theory of matroids, a graphic matroid is a matroid whose independent sets are the forests in a given finite undirected graph. The dual matroids of graphic matroids are called co-graphic matroids or bond matroids. A matroid that is both graphic and co-graphic is sometimes called a planar matroid ; these are exactly the graphic matroids formed from planar graphs.

<span class="mw-page-title-main">Dual graph</span> Graph representing faces of another graph

In the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each pair of faces in G that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge e of G has a corresponding dual edge, whose endpoints are the dual vertices corresponding to the faces on either side of e. The definition of the dual depends on the choice of embedding of the graph G, so it is a property of plane graphs rather than planar graphs. For planar graphs generally, there may be multiple dual graphs, depending on the choice of planar embedding of the graph.

<span class="mw-page-title-main">Laman graph</span>

In graph theory, the Laman graphs are a family of sparse graphs describing the minimally rigid systems of rods and joints in the plane. Formally, a Laman graph is a graph on n vertices such that, for all k, every k-vertex subgraph has at most 2k − 3 edges, and such that the whole graph has exactly 2n − 3 edges. Laman graphs are named after Gerard Laman, of the University of Amsterdam, who in 1970 used them to characterize rigid planar structures. This characterization, however, had already been discovered in 1927 by Hilda Geiringer.

<span class="mw-page-title-main">Schönhardt polyhedron</span> Non-convex polyhedron with no triangulation

In geometry, a Schönhardt polyhedron is a polyhedron with the same combinatorial structure as a regular octahedron, but with dihedral angles that are non-convex along three disjoint edges. Because it has no interior diagonals, it cannot be triangulated into tetrahedra without adding new vertices. It has the fewest vertices of any polyhedron that cannot be triangulated. It is named after German mathematician Erich Schönhardt, who described it in 1928, although artist Karlis Johansons exhibited a related structure in 1921.

<span class="mw-page-title-main">Jessen's icosahedron</span> Right-angled non-convex polyhedron

Jessen's icosahedron, sometimes called Jessen's orthogonal icosahedron, is a non-convex polyhedron with the same numbers of vertices, edges, and faces as the regular icosahedron. It is named for Børge Jessen, who studied it in 1967. In 1971, a family of nonconvex polyhedra including this shape was independently discovered and studied by Adrien Douady under the name six-beakedshaddock; later authors have applied variants of this name more specifically to Jessen's icosahedron.

In graph theory, Robbins' theorem, named after Herbert Robbins, states that the graphs that have strong orientations are exactly the 2-edge-connected graphs. That is, it is possible to choose a direction for each edge of an undirected graph G, turning it into a directed graph that has a path from every vertex to every other vertex, if and only if G is connected and has no bridge.

In the mathematics of structural rigidity, a rigidity matroid is a matroid that describes the number of degrees of freedom of an undirected graph with rigid edges of fixed lengths, embedded into Euclidean space. In a rigidity matroid for a graph with n vertices in d-dimensional space, a set of edges that defines a subgraph with k degrees of freedom has matroid rank dn − k. A set of edges is independent if and only if, for every edge in the set, removing the edge would increase the number of degrees of freedom of the remaining subgraph.

In the mathematical theory of matroids, a matroid representation is a family of vectors whose linear independence relation is the same as that of a given matroid. Matroid representations are analogous to group representations; both types of representation provide abstract algebraic structures with concrete descriptions in terms of linear algebra.

Walter John Whiteley is a professor in the department of mathematics and statistics at York University in Canada. He specializes in geometry and mathematics education, and is known for his expertise in structural rigidity and rigidity matroids.

In geometric graph theory, and the theory of structural rigidity, a parallel redrawing of a graph drawing with straight edges in the Euclidean plane or higher-dimensional Euclidean space is another drawing of the same graph such that all edges of the second drawing are parallel to their corresponding edges in the first drawing. A parallel morph of a graph is a continuous family of drawings, all parallel redrawings of each other.

Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures is an undergraduate-level book on the mathematics of structural rigidity. It was written by Jack E. Graver and published in 2001 by the Mathematical Association of America as volume 25 of the Dolciani Mathematical Expositions book series. The Basic Library List Committee of the Mathematical Association of America has recommended its inclusion by undergraduate mathematics libraries.

In the mathematics of structural rigidity, grid bracing is a problem of adding cross bracing to a square grid to make it into a rigid structure. It can be solved optimally by translating it into a problem in graph theory on the connectivity of bipartite graphs.

<i>Incidence and Symmetry in Design and Architecture</i>

Incidence and Symmetry in Design and Architecture is a book on symmetry, graph theory, and their applications in architecture, aimed at architecture students. It was written by Jenny Baglivo and Jack E. Graver and published in 1983 by Cambridge University Press in their Cambridge Urban and Architectural Studies book series. It won an Alpha Sigma Nu Book Award in 1983, and has been recommended for undergraduate mathematics libraries by the Basic Library List Committee of the Mathematical Association of America.

Strong connectivity augmentation is a computational problem in the mathematical study of graph algorithms, in which the input is a directed graph and the goal of the problem is to add a small number of edges, or a set of edges with small total weight, so that the added edges make the graph into a strongly connected graph.

A sparsity matroid is a mathematical structure that captures how densely a multigraph is populated with edges. To unpack this a little, sparsity is a measure of density of a graph that bounds the number of edges in any subgraph. The property of having a particular matroid as its density measure is invariant under graph isomorphisms and so it is a graph invariant.

Flattenability in some -dimensional normed vector space is a property of graphs which states that any embedding, or drawing, of the graph in some high dimension can be "flattened" down to live in -dimensions, such that the distances between pairs of points connected by edges are preserved. A graph is -flattenable if every distance constraint system (DCS) with as its constraint graph has a -dimensional framework. Flattenability was first called realizability, but the name was changed to avoid confusion with a graph having some DCS with a -dimensional framework.

<span class="mw-page-title-main">Geometric rigidity</span>

In discrete geometry, geometric rigidity is a theory for determining if a geometric constraint system (GCS) has finitely many -dimensional solutions, or frameworks, in some metric space. A framework of a GCS is rigid in -dimensions, for a given if it is an isolated solution of the GCS, factoring out the set of trivial motions, or isometric group, of the metric space, e.g. translations and rotations in Euclidean space. In other words, a rigid framework of a GCS has no nearby framework of the GCS that is reachable via a non-trivial continuous motion of that preserves the constraints of the GCS. Structural rigidity is another theory of rigidity that concerns generic frameworks, i.e., frameworks whose rigidity properties are representative of all frameworks with the same constraint graph. Results in geometric rigidity apply to all frameworks; in particular, to non-generic frameworks.

The Geiringer–Laman theorem gives a combinatorial characterization of generically rigid graphs in -dimensional Euclidean space, with respect to bar-joint frameworks. This theorem was first proved by Hilda Pollaczek-Geiringer in 1927, and later by Gerard Laman in 1970. An efficient algorithm called the Pebble Game is used to identify this class of graphs. This theorem has been the inspiration for many Geiringer-Laman type results for other types of frameworks with generalized Pebble games.

References