One brick at a time: a survey of inductive constructions in rigidity theory
From MaRDI portal
Publication:5261889
Abstract: We present a survey of results concerning the use of inductive constructions to study the rigidity of frameworks. By inductive constructions we mean simple graph moves which can be shown to preserve the rigidity of the corresponding framework. We describe a number of cases in which characterisations of rigidity were proved by inductive constructions. That is, by identifying recursive operations that preserved rigidity and proving that these operations were sufficient to generate all such frameworks. We also outline the use of inductive constructions in some recent areas of particularly active interest, namely symmetric and periodic frameworks, frameworks on surfaces, and body-bar frameworks. We summarize the key outstanding open problems related to inductions.
Recommendations
- Inductive constructions for combinatorial local and global rigidity
- Periodic rigidity on a variable torus using inductive constructions
- An inductive construction of minimally rigid body-hinge simple graphs
- scientific article; zbMATH DE number 3859878
- Inductive constructions for frameworks on a two-dimensional fixed torus
Cites work
- scientific article; zbMATH DE number 4194602 (Why is no real title available?)
- scientific article; zbMATH DE number 3917126 (Why is no real title available?)
- scientific article; zbMATH DE number 1182943 (Why is no real title available?)
- scientific article; zbMATH DE number 30657 (Why is no real title available?)
- scientific article; zbMATH DE number 50766 (Why is no real title available?)
- scientific article; zbMATH DE number 718857 (Why is no real title available?)
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- A note on \([k,l]\)-sparse graphs
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- A proof of the molecular conjecture
- An inductive construction of \((2,1)\)-tight graphs
- Conditions for Unique Graph Realizations
- Connected rigidity matroids and unique realizations of graphs
- Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths
- Constructive characterizations for packing and covering with trees
- Edge-Disjoint Spanning Trees of Finite Graphs
- Equivalent realisations of a rigid graph
- Frameworks with forced symmetry. I: Reflections and rotations
- Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
- Generic combinatorial rigidity of periodic frameworks
- Generic global rigidity
- Globally linked pairs of vertices in equivalent realizations of graphs
- Globally rigid circuits of the direction-length rigidity matroid
- Graph Drawing
- Isostatic block and hole frameworks
- Minimally rigid periodic graphs
- Multitriangulations as complexes of star polygons
- On graphs and rigidity of plane skeletal structures
- On the 2-sum in rigidity matroids
- On the generic rigidity of bar-frameworks
- Operations preserving the global rigidity of graphs and frameworks in the plane
- Pebble game algorithms and sparse graphs
- Periodic body-and-bar frameworks
- Periodic rigidity on a variable torus using inductive constructions
- Pseudo-triangulations -- a survey
- Rigidity of Frameworks Supported on Surfaces
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- Symmetric Laman theorems for the groups \(\mathcal C_2\) and \(\mathcal C_s\)
- Symmetric versions of Laman's theorem
- The Rigidity of Graphs
- The number of embeddings of minimally rigid graphs
- The rigidity of periodic body-bar frameworks on the three-dimensional fixed torus
Cited in
(9)- Symmetry-forced rigidity of frameworks on surfaces
- Frameworks with Coordinated Edge Motions
- On the spectrum of the normalized Laplacian of iterated triangulations of graphs
- On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere
- Inductive constructions for frameworks on a two-dimensional fixed torus
- Self-dual polyhedra of given degree sequence
- The rigidity of infinite graphs. II
- Inductive constructions for combinatorial local and global rigidity
- An inductive construction of minimally rigid body-hinge simple graphs
This page was built for publication: One brick at a time: a survey of inductive constructions in rigidity theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261889)
