Related papers: Generic Rigidity Matroids with Dilworth Truncation…
Symmetry equations are obtained for the rigidity matrix of a bar-joint framework in R^d. These form the basis for a short proof of the Fowler-Guest symmetry group generalisation of the Calladine-Maxwell counting rules. Similar symmetry…
We show that universal rigidity of a generic bar and joint framework (G,p) in the line depends on more than the ordering of the vertices. In particular, we construct examples of one-dimensional generic frameworks with the same graph and…
For ${n \in \mathbb{N}}$, the $n$-truncation of a matroid $M$ of rank at least $n$ is the matroid whose bases are the $n$-element independent sets of $M$. One can extend this definition to negative integers by letting the $(-n)$-truncation…
A bar framework in R^r, denoted by G(p), is a simple connected graph G whose vertices are points p^1,...,p^n in R^r that affinely span R^r, and whose edges are line segments between pairs of these points. In this paper, we use stress…
Following a review of related results in rigidity theory, we provide a construction to obtain generically universally rigid frameworks with the minimum number of edges, for any given set of n nodes in two or three dimensions. When a set of…
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…
We define a generic rigidity matroid for $k$-volumes of a simplicial complex in $\mathbb{R}^d$, and prove that for $2\leq k \leq d-1$ it has the same rank as the classical generic $d$-rigidity matroid on the same vertex set (namely, the…
A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…
A bar-joint framework $(G,p)$ in the Euclidean space $\mathbb{E}^d$ is globally rigid if it is the unique realisation, up to rigid congruences, of $G$ in $\mathbb{E}^d$ with the edge lengths of $(G,p)$. Building on key results of…
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…
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…
We characterize the combinatorial types of symmetric frameworks in the plane that are minimally generically symmetry-forced infinitesimally rigid when the symmetry group consists of rotations and translations. Along the way, we use tropical…
A configuration p in r-dimensional Euclidean space is a finite collection of labeled points p^1,p^2,...,p^n in R^r that affinely span R^r. Each configuration p defines a Euclidean distance matrix D_p = (d_ij) = (||p^i-p^j||^2), where ||.||…
We showed in the first paper of this series that the generic $C_2^1$-cofactor matroid is the unique maximal abstract $3$-rigidity matroid. In this paper we obtain a combinatorial characterization of independence in this matroid. This solves…
A G-gain graph is a graph whose oriented edges are labeled invertibly from a group G. Zaslavsky proposed two matroids of G-gain graphs, called frame matroids and lift matroids, and investigated linear representations of them. Each matroid…
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…
We propose new symmetry-adapted rigidity matrices to analyze the infinitesimal rigidity of arbitrary-dimensional bar-joint frameworks with Abelian point group symmetries. These matrices define new symmetry-adapted rigidity matroids on…
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…
We show that a generic framework $(G,p)$ on the cylinder is globally rigid if and only if $G$ is a complete graph on at most four vertices or $G$ is both redundantly rigid and $2$-connected. To prove the theorem we also derive a new…
This paper proposes a unified approach for dynamic modeling and simulations of general tensegrity structures with rigid bars and rigid bodies of arbitrary shapes. The natural coordinates are adopted as a non-minimal description in terms of…