2021
DOI: 10.1137/20m134304x
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Bound for the Rigidity of Linearly Constrained Frameworks

Abstract: We consider the problem of characterising the generic rigidity of bar-joint frameworks in 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 d ≥ t(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 d ≥… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 9 publications
(11 reference statements)
0
7
0
Order By: Relevance
“…However, a possibly more tractable and more widely applicable problem is to move to linearly constrained frameworks (see, for example, [6]). These frameworks, in the 3-dimensional case, model 'generic surfaces', but are easily adaptable to arbitrary dimension where some interesting results are known [6,12].…”
Section: Discussionmentioning
confidence: 99%
“…However, a possibly more tractable and more widely applicable problem is to move to linearly constrained frameworks (see, for example, [6]). These frameworks, in the 3-dimensional case, model 'generic surfaces', but are easily adaptable to arbitrary dimension where some interesting results are known [6,12].…”
Section: Discussionmentioning
confidence: 99%
“…In the case where the linear constraints are generic, a 2-dimensional analogue of Laman's theorem (closely analogous to Theorem 4) was proved by Streinu and Theran [46] and this has been extended to all dimensions, under additional hypotheses on the dimension of the affine subspaces each vertex is restricted to, first in [81] and then in [79]. Moreover if one restricts to body-bar frameworks or to 2-dimensions but allows nongeneric linear constraints, as in Theorem 4, then combinatorial characterisations are also known [82].…”
Section: Linear Constraints As Slidersmentioning
confidence: 98%
“…While giving an emphasis here to sliders viewed as points at infinity, there are multiple other strands of mathematical and applied work that connect to sliders, and points constrained to follow lines or plane [43,46,79]. See below for stronger connections.…”
Section: Joints At Infinity and Slidersmentioning
confidence: 99%
“…It would be an interesting future project to extend our analysis to higher dimensions. While for bar-joint frameworks little is known when d ≥ 3, in the linearly constrained case characterisations are known when suitable assumptions are made on the affine subspaces defined by the linear constraints [5,10].…”
Section: Rigidity Theorymentioning
confidence: 99%
“…Streinu and Theran [24] proved a characterisation of generic rigidity for linearly constrained frameworks in R 2 . The articles [5,10] provide an analogous characterisation for generic rigidity of linearly constrained frameworks in R d as long as the dimensions of the affine subspaces at each vertex are sufficiently small (compared to d), and [8] characterises the stronger notion of global rigidity in this context.…”
Section: Introductionmentioning
confidence: 99%