A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in $\mathbb{R}^2$

TL;DR

This paper establishes a new connectivity condition that guarantees rigidity and global rigidity of linearly constrained frameworks in the plane, extending previous characterizations by leveraging submodular functions and thin covers.

Contribution

It introduces a sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in , based on a novel application of submodular functions and thin covers.

Findings

Provides a new sufficient connectivity condition for rigidity.

Extends Lovsz and Yemini's results to constrained frameworks.

Connects matroid rank functions with graph connectivity in rigidity theory.

Abstract

We study the bar-and-joint frameworks in $\mathbb{R}^2$ such that some vertices are constrained to lie on some lines. The generic rigidity of such frameworks is characterised by Streinu and Theran (2010). Katoh and Tanigawa (2013) remarked that the corresponding matroid and its rank function can be characterised by using a submodular function. In this paper, we will transfer this characterisation of the rank function to the form of the value of a ``1-thin cover" and obtain a sufficient connectivity condition for rigidity and global rigidity of these frameworks analogous to the results of Lov\'asz and Yemini (1982).