Related papers: Almost-rigidity of frameworks
This work considers the problem of estimating the unscaled relative positions of a multi-robot team in a common reference frame from bearing-only measurements. Each robot has access to a relative bearing measurement taken from the local…
Motivated by the challenging formation stabilization problem for mobile robotic teams when no distance or relative displacement measurements are available and each robot can only measure some of those angles formed by rays towards its…
The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…
The theory of disordered elastic systems is one of the most powerful frameworks to assess the physics of multiple systems that span from ferromagnets to migrating biological cells. In this formalism, one assumes that the system can be…
For a general radially symmetric, non-increasing, non-negative kernel $h\in L ^ 1 _{loc} ( R ^ d)$, we study the rigidity of measurable sets in $R ^ d$ with constant nonlocal $h$-mean curvature. Under a suitable "improved integrability"…
We present a survey of results concerning the use of inductive constructions to study the rigidity of frameworks. By inductive constructions we mean simple graph moves which can be shown to preserve the rigidity of the corresponding…
While the problem of determining whether an embedding of a graph $G$ in $\mathbb{R}^2$ is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\it rigid} or not is still a hard task that usually…
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…
A form-finding problem for tensegrity structures is studied; given an abstract graph, we show an algorithm to provide a necessary condition for it to be the underlying graph of a tensegrity in $\mathbb{R}^d$ (typically $d=2,3$) with…
We consider the rigidity and global rigidity of bar-joint frameworks in Euclidean $d$-space under additional dilation constraints in specified coordinate directions. In this setting we obtain a complete characterisation of generic rigidity.…
We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…
This work focuses on the bearing rigidity theory, namely the branch of knowledge investigating the structural properties necessary for multi-element systems to preserve the inter-units bearings when exposed to deformations. The original…
In this article, we prove a rigidity theorem for isometric embeddings into the Schwarzschild manifold, by using the variational formula of quasi-local mass.
This paper introduces new structures called conic frameworks and their rigidity. They are composed by agents and a set of directed constraints between pairs of agents. When the structure cannot be flexed while preserving the constraints, it…
A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant norm. Analogues of Maxwell's counting criteria are obtained and minimally rigid matrix frameworks are shown to belong to the…
We develop a general theory of local stability up to belonging to an ideal (e.g. having measure zero). From a model-theoretic perspective, we prove a stationarity principle for almost stable formulas in this sense, and build a topological…
This paper is a continuation of our paper about boundary rigidity and filling minimality of metrics close to flat ones. We show that compact regions close to a hyperbolic one are boundary distance rigid and strict minimal fillings. We also…
A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…
A tensegrity is a structure made from cables, struts and stiff bars. A $d$-dimensional tensegirty is universally rigid if it is rigid in any dimension $d'$ with $d'\geq d$. The celebrated super stability condition due to Connelly gives a…
In this paper we prove a recursive characterisation of generic rigidity for frameworks periodic with respect to a partially variable lattice. We follow the approach of modelling periodic frameworks as frameworks on a torus and use the…