Slider-pinning rigidity: a Maxwell-Laman-type theorem
From MaRDI portal
(Redirected from Publication:603881)
Abstract: We define and study slider-pinning rigidity, giving a complete combinatorial characterization. This is done via direction-slider networks, which are a generalization of Whiteley's direction networks.
Recommendations
- On the Infinitesimal Rigidity of Bar-and-Slider Frameworks
- Rigidity of Frameworks Supported on Surfaces
- Point-hyperplane frameworks, slider joints, and rigidity preserving transformations
- A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
- Rigidity of linearly constrained frameworks
Cites work
- A matroid on hypergraphs, with applications in scene analysis and geometry
- A new proof of Laman's theorem
- Characterizing Sparse Graphs by Map Decompositions
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3959442 (Why is no real title available?)
- scientific article; zbMATH DE number 50766 (Why is no real title available?)
- scientific article; zbMATH DE number 3493472 (Why is no real title available?)
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- scientific article; zbMATH DE number 5174567 (Why is no real title available?)
- Matroid matching and some applications
- On Generic Rigidity in the Plane
- On graphs and rigidity of plane skeletal structures
- Pebble game algorithms and sparse graphs
- Source location with rigidity and tree packing requirements
- Sparsity-certifying graph decompositions
- The Union of Matroids and the Rigidity of Frameworks
Cited in
(12)- Point-hyperplane frameworks, slider joints, and rigidity preserving transformations
- Combinatorial rigidity of incidence systems and application to dictionary learning
- A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
- Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
- Combinatorial rigidity and independence of generalized pinned subspace-incidence constraint systems
- An improved bound for the rigidity of linearly constrained frameworks
- Generic unlabeled global rigidity
- Computing Circuit Polynomials in the Algebraic Rigidity Matroid
- Trilateration using unlabeled path or loop lengths
- Global Rigidity of Line Constrained Frameworks
- Rigidity of symmetric linearly constrained frameworks in the plane
- Frameworks with forced symmetry. I: Reflections and rotations
This page was built for publication: Slider-pinning rigidity: a Maxwell-Laman-type theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603881)
