Global Rigidity of Line Constrained Frameworks
From MaRDI portal
Abstract: We consider the global rigidity problem for bar-joint frameworks where each vertex is constrained to lie on a particular line in . In our setting we allow multiple vertices to be constrained to the same line. Under a mild assumption on the given set of lines we give a complete combinatorial characterisation of graphs that are generically globally rigid in this setting. This gives a -dimensional extension of the well-known combinatorial characterisation of 1-dimensional global rigidity.
Recommendations
- Global rigidity of 2D linearly constrained frameworks
- Rigidity of linearly constrained frameworks
- An improved bound for the rigidity of linearly constrained frameworks
- A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
- Rigid frameworks with dilation constraints
Cites work
- A new decision method for elementary algebra
- An improved bound for the rigidity of linearly constrained frameworks
- Characterizing generic global rigidity
- Conditions for Unique Graph Realizations
- Connected rigidity matroids and unique realizations of graphs
- Flexible circuits in the d‐dimensional rigidity matroid
- Generic global rigidity of body-hinge frameworks
- Global rigidity of 2D linearly constrained frameworks
- scientific article; zbMATH DE number 3686285 (Why is no real title available?)
- On graphs and rigidity of plane skeletal structures
- Rigidity of Frameworks Supported on Surfaces
- Rigidity of linearly constrained frameworks
- Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
- Slider-pinning rigidity: a Maxwell-Laman-type theorem
- The d-dimensional rigidity matroid of sparse graphs
- The Rigidity of Graphs
Cited in
(2)
This page was built for publication: Global Rigidity of Line Constrained Frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202752)