English
Related papers

Related papers: Iterative Universal Rigidity

200 papers

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…

Metric Geometry · Mathematics 2013-05-28 A. Y. Alfakih , Viet-Hang Nguyen

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 ||.||…

Metric Geometry · Mathematics 2012-01-17 A. Y. Alfakih

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…

Combinatorics · Mathematics 2014-08-12 Shin-ichi Tanigawa

In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo-Euclidean space ($R^d$ with a metric of indefinite signature). We show that a…

Metric Geometry · Mathematics 2017-08-29 Steven J. Gortler , Dylan P. Thurston

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…

Metric Geometry · Mathematics 2019-03-12 Victor Alexandrov

We provide a way of determining the infinitesimal rigidity of rod configurations realizing a rank two incidence geometry in the Euclidean plane. We model each rod with a cone over its point set and prove that the resulting geometric…

Combinatorics · Mathematics 2022-04-28 Signe Lundqvist , Klara Stokes , Lars-Daniel Öhman

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…

History and Overview · Mathematics 2025-08-19 James Cruickshank , Bill Jackson , Tibor Jordán , Shin-ichi Tanigawa

Rigidity is the property of a structure that does not flex. It is well studied in discrete geometry and mechanics, and has applications in material science, engineering and biological sciences. A bar-and-joint framework is a pair $(G,p)$ of…

Combinatorics · Mathematics 2021-03-02 Sebastian M. Cioabă , Sean Dewar , Xiaofeng Gu

We develop a rigidity theory for bar-joint frameworks in Euclidean $d$-space in which specified classes of edges are allowed to change length in a coordinated fashion that requires differences of lengths to be preserved within each class.…

Metric Geometry · Mathematics 2022-06-14 Bernd Schulze , Hattie Serocold , Louis Theran

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…

Combinatorics · Mathematics 2022-06-16 Sean Dewar , John Hewetson , Anthony Nixon

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…

Combinatorics · Mathematics 2016-07-05 Katie Clinch , Bill Jackson , Peter Keevash

A rigidity theory is developed for bar-joint frameworks in $\mathbb{R}^{d+1}$ whose vertices are constrained to lie on concentric $d$-spheres with independently variable radii. In particular, combinatorial characterisations are established…

Metric Geometry · Mathematics 2017-02-14 Anthony Nixon , Bernd Schulze , Shin-ichi Tanigawa , Walter Whiteley

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…

Combinatorics · Mathematics 2018-10-16 Bill Jackson , Anthony Nixon

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 motions of the vertices arise from…

Combinatorics · Mathematics 2023-12-20 Anthony Nixon , Bernd Schulze , Joseph Wall

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…

Metric Geometry · Mathematics 2025-02-14 Dániel Garamvölgyi , Steven J. Gortler , Tibor Jordán

A linearly constrained framework in $\mathbb{R}^d$ is a point configuration together with a system of constraints which fixes the distances between some pairs of points and additionally restricts some of the points to lie in given affine…

Combinatorics · Mathematics 2022-12-09 Hakan Guler , Bill Jackson , Anthony Nixon

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…

Combinatorics · Mathematics 2024-08-28 Joannes Vermant , Klara Stokes

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…

Metric Geometry · Mathematics 2014-01-08 D. Kitson

Here it is shown how to combine two generically globally rigid bar frameworks in $d$-space to get another generically globally rigid framework. The construction is to identify $d+1$ vertices from each of the frameworks and erase one of the…

Metric Geometry · Mathematics 2011-03-31 Robert Connelly

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…

Metric Geometry · Mathematics 2013-10-08 D. Kitson , S. C. Power