An improved bound for the rigidity of linearly constrained frameworks

DOI10.1137/20M134304XMaRDI QIDQ4990392zbMATH OpenOpenAlexFDO

Authors Bill Jackson, Anthony Nixon, Shin-Ichi Tanigawa

Publication date 28 May 2021

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.11051

zbMATH Keywords

count matroidlinearly constrained frameworkpinned frameworkrigidity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Surfaces in Euclidean and related spaces (53A05)

Abstract: We consider the problem of characterising the generic rigidity of bar-joint frameworks in $mathbb{R}^d$ in which each vertex is constrained to lie in a given affine subspace. The special case when $d=2$ was previously solved by I. Streinu and L. Theran in 2010 and the case when each vertex is constrained to lie in an affine subspace of dimension $t$, and $dgeqt(t-1)$ was solved by Cruickshank, Guler and the first two authors in 2019. We extend the latter result by showing that the given characterisation holds whenever $dgeq2t$.

Recommendations

• Rigidity of linearly constrained frameworks
• Global rigidity of 2D linearly constrained frameworks
• A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
• Rigidity of Frameworks Supported on Surfaces
• A characterisation of the generic rigidity of 2-dimensional point-line frameworks

Cites work

• A characterization of generically rigid frameworks on surfaces of revolution
• Combinatorial characterization of the Assur graphs from engineering
• Point-hyperplane frameworks, slider joints, and rigidity preserving transformations
• 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 Rigidity of Graphs

Cited in

(15)

• A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
• A characterisation of the generic rigidity of 2-dimensional point-line frameworks
• Combinatorial rigidity and independence of generalized pinned subspace-incidence constraint systems
• Affine rigidity and conics at infinity
• Combinatorial Algorithm for a Lower Bound on Frame Rigidity
• Global rigidity of 2D linearly constrained frameworks
• Rigidity of linearly constrained frameworks
• <scp>Almost‐Rigidity</scp> of Frameworks
• scientific article; zbMATH DE number 6606168 (Why is no real title available?)
• Automated Deduction in Geometry
• On the existence of two affine-equivalent frameworks with prescribed edge lengths in Euclidean d -space
• Global Rigidity of Line Constrained Frameworks
• Rigid frameworks with dilation constraints
• Rigidity of symmetric linearly constrained frameworks in the plane
• Rigidity of symmetric frameworks on the cylinder

This page was built for publication: An improved bound for the rigidity of linearly constrained frameworks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4990392)