Slider-pinning rigidity: a Maxwell-Laman-type theorem
From MaRDI portal
Publication:603881
DOI10.1007/s00454-010-9283-yzbMath1211.52024arXiv0712.0031OpenAlexW2064548067MaRDI QIDQ603881
Publication date: 8 November 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0712.0031
Related Items (11)
Combinatorial Rigidity and Independence of Generalized Pinned Subspace-Incidence Constraint Systems ⋮ Frameworks with forced symmetry. I: Reflections and rotations ⋮ Computing Circuit Polynomials in the Algebraic Rigidity Matroid ⋮ Trilateration using unlabeled path or loop lengths ⋮ Global Rigidity of Line Constrained Frameworks ⋮ Point-hyperplane frameworks, slider joints, and rigidity preserving transformations ⋮ Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups ⋮ Combinatorial rigidity of incidence systems and application to dictionary learning ⋮ GENERIC UNLABELED GLOBAL RIGIDITY ⋮ 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\)
Cites Work
- Source location with rigidity and tree packing requirements
- Sparsity-certifying graph decompositions
- A matroid on hypergraphs, with applications in scene analysis and geometry
- Matroid matching and some applications
- A new proof of Laman's theorem
- Pebble game algorithms and sparse graphs
- On graphs and rigidity of plane skeletal structures
- The Union of Matroids and the Rigidity of Frameworks
- On Generic Rigidity in the Plane
- Characterizing Sparse Graphs by Map Decompositions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Slider-pinning rigidity: a Maxwell-Laman-type theorem
