One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory
From MaRDI portal
Publication:5261889
DOI10.1007/978-1-4939-0781-6_15zbMATH Open1320.52024arXiv1203.6623OpenAlexW2151330371MaRDI QIDQ5261889FDOQ5261889
Publication date: 8 July 2015
Published in: Rigidity and Symmetry (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1203.6623
Cites Work
- Connected rigidity matroids and unique realizations of graphs
- Generic combinatorial rigidity of periodic frameworks
- Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
- Pebble game algorithms and sparse graphs
- Generic global rigidity
- On graphs and rigidity of plane skeletal structures
- Periodic frameworks and flexibility
- Edge-Disjoint Spanning Trees of Finite Graphs
- Title not available (Why is that?)
- Conditions for Unique Graph Realizations
- Title not available (Why is that?)
- A proof of the molecular conjecture
- Symmetric versions of Laman's theorem
- Frameworks with forced symmetry. I: Reflections and rotations
- The Rigidity of Graphs
- Title not available (Why is that?)
- Rigidity of Frameworks Supported on Surfaces
- An Inductive Construction of (2,1)-tight Graphs
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- Constructive characterizations for packing and covering with trees
- Globally linked pairs of vertices in equivalent realizations of graphs
- Multitriangulations as complexes of star polygons
- Title not available (Why is that?)
- Isostatic block and hole frameworks
- Title not available (Why is that?)
- Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Operations preserving the global rigidity of graphs and frameworks in the plane
- On the 2-sum in rigidity matroids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Symmetric Laman theorems for the groups \(\mathcal C_2\) and \(\mathcal C_s\)
- Globally rigid circuits of the direction-length rigidity matroid
- Minimally rigid periodic graphs
- Title not available (Why is that?)
- Periodic rigidity on a variable torus using inductive constructions
- The number of embeddings of minimally rigid graphs
- Equivalent realisations of a rigid graph
- The rigidity of periodic body–bar frameworks on the three-dimensional fixed torus
- Graph Drawing
- Title not available (Why is that?)
- Periodic body-and-bar frameworks
- On the generic rigidity of bar-frameworks
Cited In (7)
- Symmetry-forced rigidity of frameworks on surfaces
- The rigidity of infinite graphs. II
- Self-dual polyhedra of given degree sequence
- Inductive constructions for frameworks on a two-dimensional fixed torus
- On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere
- Frameworks with Coordinated Edge Motions
- On the spectrum of the normalized Laplacian of iterated triangulations of 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)
