2014
DOI: 10.1007/978-1-4939-0781-6_15
|View full text |Cite
|
Sign up to set email alerts
|

One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory

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 ou… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(17 citation statements)
references
References 58 publications
(91 reference statements)
0
17
0
Order By: Relevance
“…From this angle, the two planes are projected onto the lines separating the colored regions in the figure, and the line s 5 ¼ s 6 ¼ 0 along which these planes intersect becomes the line passing through the origin that is normal to the plane of the figure. Henneberg moves [27,36,37] are rigidity-preserving transformations of graphs that are useful in rigidity theory. We consider only the Henneberg-1 move, which in three dimensions is just the addition of a new vertex, and attach it to the original graph with three new edges.…”
Section: H1 Triangulations and Butterfliesmentioning
confidence: 99%
“…From this angle, the two planes are projected onto the lines separating the colored regions in the figure, and the line s 5 ¼ s 6 ¼ 0 along which these planes intersect becomes the line passing through the origin that is normal to the plane of the figure. Henneberg moves [27,36,37] are rigidity-preserving transformations of graphs that are useful in rigidity theory. We consider only the Henneberg-1 move, which in three dimensions is just the addition of a new vertex, and attach it to the original graph with three new edges.…”
Section: H1 Triangulations and Butterfliesmentioning
confidence: 99%
“…Also let ′′ be formed from by deleting two non-adjacent edges , from and adding a new vertex and edges , , , for , , , ∈ . This operation is known as -replacement [15,18]. As outlined above, when a circuit is sufficiently connected we will show that either a 1-reduction or an inverse -replacement can be applied to form a new circuit.…”
Section: F I G U R E 4 Base Graphs On Nine Verticesmentioning
confidence: 88%
“…One indication of the potential difficulty to overcome here is that the minimum vertex degree in the graph may be 4. The analogue of the Henneberg moves for degree 4 vertices are known as X and V-replacement [7,11,21,35]. V-replacement is known to not preserve (2, ℓ)-sparsity.…”
Section: Further Workmentioning
confidence: 99%
“…X-replacement has been used to some effect in [11] so it is plausible that it could be used for the cases in question here. However, while X-replacement (as an operation on frameworks) is easy to understand in the plane (the generic argument is based on the simple fact that, generically, two lines intersect (see also [11])), the question whether the corresponding operation in 3-dimensions preserves generic rigidity is still open [7,21] (two generic lines in 3D need not intersect!). This difficulty also arises for X-replacements on frameworks supported on surfaces since two lines will typically not intersect in a point on the surface.…”
Section: Further Workmentioning
confidence: 99%