Related papers: Frameworks with coordinated edge motions
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…
A 2-dimensional direction-length framework is a collection of points in the plane which are linked by pairwise constraints that fix the direction or length of the line segments joining certain pairs of points. We represent it as a pair…
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…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
Graph rigidity, the study of vertex realizations in $\mathbb{R}^d$ and the motions that preserve the induced edge lengths, has been the focus of extensive research for decades. Its equivalency to graph connectivity for $d=1$ is well known;…
How does one determine if a collection of bars joined by freely rotating hinges cannot be deformed without changing the length of any of the bars? In other words, how does one determine if a bar-joint graph is rigid? This question has been…
A $d$-dimensional framework is a pair $(G,p)$, where $G=(V,E)$ is a graph and $p$ is a map from $V$ to $\mathbb{R}^d$. The length of an edge $uv\in E$ in $(G,p)$ is the distance between $p(u)$ and $p(v)$. The framework is said to be…
Combinatorial characterisations are obtained of symmetric and anti-symmetric infinitesimal rigidity for two-dimensional frameworks with reflectional symmetry in the case of norms where the unit ball is a quadrilateral and where the…
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…
We study the problem of existence of two affine-equivalent bar-and-joint frameworks in Euclidean $d$-space which have prescribed combinatorial structure and edge lengths. We prove that theoretically this problem is always solvable, but we…
A number of recent papers have studied when symmetry causes frameworks on a graph to become infinitesimally flexible, or stressed, and when it has no impact. A number of other recent papers have studied special classes of frameworks on…
We examine the generic local and global rigidity of various graphs in R^d. Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d+1)-connectedness and generic redundant rigidity and hypothesized that they…
A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…
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…
In this paper, we give a complete self-contained proof that the rigidity matrix of a symmetric bar and joint framework (as well as its transpose) can be transformed into a block-diagonalized form using techniques from group representation…
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…
A $d$-dimensional framework is a pair $(G,p)$, where $G$ is a graph and $p$ maps the vertices of $G$ to points in $\mathbb{R}^d$. The edges of $G$ are mapped to the corresponding line segments. A graph $G$ is said to be globally rigid in…
We show the existence of infinitesimally rigid bipartite unit-bar frameworks in $\mathbb{R}^d$. We also construct unit-bar frameworks with girth up to 12 that are infinitesimally rigid in the plane. This answers problems proposed by…
Periodic frameworks with crystallographic symmetry are investigated from the perspective of a general deformation theory of periodic bar-and-joint structures in $R^d$. It is shown that natural parametrizations provide affine section…
We show that, for points along the moment curve, the bar-and-joint rigidity matroid and the hyperconnectivity matroid coincide, and that both coincide with the $C^{d-2}_{d-1}$-cofactor rigidity of points along any (non-degenerate) conic in…