相关论文: Rigidity of symmetric linearly constrained framewo…
A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous deformations of the vertices arise from…
A linearly constrained framework in $\mathbb{R}^d$ is a bar-joint framework where, in addition, vertices with loops are constrained to lie in given affine subspaces. In the generic case, when each vertex is incident to sufficiently many…
A bar-joint framework $(G,p)$ is the combination of a graph $G$ and a map $p$ assigning positions, in some space, to the vertices of $G$. The framework is rigid if every edge-length-preserving continuous motion of the vertices arises from…
A $d$-dimensional (bar-and-joint) framework $(G,p)$ consists of a graph $G=(V,E)$ and a realisation $p:V\to \mathbb{R}^d$. It is rigid if every continuous motion of the vertices which preserves the lengths of the edges is induced by an…
We consider the global rigidity problem for bar-joint frameworks where each vertex is constrained to lie on a particular line in $\mathbb R^d$. In our setting we allow multiple vertices to be constrained to the same line. Under a mild…
We show that if the joints of a bar and joint framework $(G,p)$ are positioned as `generically' as possible subject to given symmetry constraints and $(G,p)$ possesses a `fully-symmetric' infinitesimal flex (i.e., the velocity vectors of…
A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…
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 consider the problem of characterising the generic rigidity of bar-joint frameworks in $\mathbb{R}^d$ in which each vertex is constrained to lie in a given affine subspace. The special case when $d=2$ was previously solved by I. Streinu…
Recent work has shown that if an isostatic bar and joint framework possesses non-trivial symmetries, then it must satisfy some very simply stated restrictions on the number of joints and bars that are `fixed' by various symmetry operations…
A fundamental theorem of Laman characterises when a bar-joint framework realised generically in the Euclidean plane admits a non-trivial continuous deformation of its vertices. This has recently been extended in two ways. Firstly to…
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 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 rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…
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.…
A (bar-and-joint) framework is a set of points in a normed space with a set of fixed distance constraints between them. Determining whether a framework is locally rigid - i.e. whether every other suitably close framework with the same…
It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give…
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 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…
The rigidity matrix is a fundamental tool for studying the infinitesimal rigidity properties of Euclidean bar-joint frameworks. In this paper we generalize this tool and introduce a rigidity matrix for bar-joint frameworks in arbitrary…