Related papers: Rigidity of linearly-constrained frameworks

In 1992, Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions for a generic (non-complete) bar-joint framework to be globally rigid in $\mathbb{R}^d$. Jackson and Jordan confirmed in 2005 that these…

We present necessary and sufficient conditions for the generic rigidity of body-bar frameworks on the three-dimensional fixed torus. These frameworks correspond to infinite periodic body-bar frameworks in $\mathbb{R}^3$ with a fixed…

A framework (a straight-line embedding of a graph into a normed space allowing edges to cross) is globally rigid if any other framework with the same edge lengths with respect to the chosen norm is an isometric copy. We investigate global…

We investigate how to find generic and globally rigid realizations of graphs in $\mathbb{R}^d$ based on elementary geometric observations. Our arguments lead to new proofs of a combinatorial characterization of the global rigidity of graphs…

A d-dimensional framework is a graph and a map from its vertices to E^d. Such a framework is globally rigid if it is the only framework in E^d with the same graph and edge lengths, up to rigid motions. For which underlying graphs is a…

In structural rigidity, one studies frameworks of bars and joints in Euclidean space. Such a framework is an articulated structure consisting of rigid bars, joined together at joints around which the bars may rotate. In this paper, we will…

A $d$-dimensional bar-and-joint framework $(G,p)$ with underlying graph $G$ is called universally rigid if all realizations of $G$ with the same edge lengths, in all dimensions, are congruent to $(G,p)$. A graph $G$ is said to be…

Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1 \leq r \leq n-2$, then there exists a configuration $p$ in general position in $R^r$ such that the bar framework $(G,p)$ is universally…

The minimal infinitesimal rigidity of bar-joint frameworks in the non-Euclidean spaces (R^2, ||.||_q) are characterised in terms of (2,2)-tight graphs. Specifically, a generically placed bar-joint framework (G,p) in the plane is minimally…

A result due in its various parts to Hendrickson, Connelly, and Jackson and Jord\'an, provides a purely combinatorial characterisation of global rigidity for generic bar-joint frameworks in $\mathbb{R}^2$. The analogous conditions are known…

We characterise finite and infinitesimal rigidity for bar-joint frameworks in R^d with respect to polyhedral norms (i.e. norms with closed unit ball P a convex d-dimensional polytope). Infinitesimal and continuous rigidity are shown to be…

A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…

It is well-known that the property of a bar-and-joint framework `to be infinitesimally rigid' is invariant under projective transformations of Eucliean $d$-space for every $d\geqslant 2$. It is less known that the property of a…

A realisation of a graph in the plane as a bar-joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely-many realisations can be seen as a solution to a…

A bar-joint framework $(G,p)$ in $\mathbb{R}^d$ is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of $\mathbb{R}^d$. It is known that, when $(G,p)$ is generic, its rigidity depends only on…

A graph $G=(V,E)$ is $d$-sparse if each subset $X\subseteq V$ with $|X|\geq d$ induces at most $d|X|-{{d+1}\choose{2}}$ edges in $G$. Maxwell showed in 1864 that a necessary condition for a generic bar-and-joint framework with at least…

We prove that if a framework of a graph is neighborhood affine rigid in $d$-dimensions (or has the stronger property of having an equilibrium stress matrix of rank $n-d-1$) then it has an affine flex (an affine, but non Euclidean, transform…

A $d$-dimensional tensegrity framework $(T,p)$ is an edge-labeled geometric graph in ${\mathbb R}^d$, which consists of a graph $T=(V,B\cup C\cup S)$ and a map $p:V\to {\mathbb R}^d$. The labels determine whether an edge $uv$ of $T$…

Recently, Alfakih and Ye [Lin. Algebra Appl. 438:31--36, 2013] proved that if an $r$-dimensional bar framework $(G,p)$ on $n \geq r+2$ nodes in general position in $\R^r$ admits a positive semidefinite stress matrix with rank $n-r-1$, then…

A bar-and-joint framework is a finite set of points together with specified distances between selected pairs. In rigidity theory we seek to understand when the remaining pairwise distances are also fixed. If there exists a pair of points…