Slider-pinning rigidity: a Maxwell-Laman-type theorem

DOI10.1007/s00454-010-9283-yzbMath1211.52024arXiv0712.0031MaRDI QIDQ603881

Ileana Streinu, Louis Theran

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

zbMATH Keywords

matroids; sparse graphs; bar-joint rigidity; bar-slider rigidity; sliders

Mathematics Subject Classification ID

52C25: Rigidity and flexibility of structures (aspects of discrete geometry)

Related Items

Frameworks with forced symmetry. I: Reflections and rotations, Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups, Combinatorial Rigidity and Independence of Generalized Pinned Subspace-Incidence Constraint Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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