English
Related papers

Related papers: Global Rigidity of Line Constrained Frameworks

200 papers

Whiteley \cite{wh} gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined graphs, a family of graphs that contain the complete…

Metric Geometry · Mathematics 2011-01-04 Timothy Sun , Chun Ye

A bar-joint framework $(G,p)$ in $\mathbb{R}^d$ is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of $\mathbb{R}^d$. It is known that, when $(G,p)$ is generic, its rigidity depends only on…

Combinatorics · Mathematics 2023-03-27 Georg Grasegger , Hakan Guler , Bill Jackson , Anthony Nixon

We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…

Combinatorics · Mathematics 2012-10-24 Justin Malestein , Louis Theran

A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…

Combinatorics · Mathematics 2025-06-30 Rebecca Monks , Anthony Nixon

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

We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…

Geometric Topology · Mathematics 2015-03-19 Justin Malestein , Louis Theran

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…

Optimization and Control · Mathematics 2020-05-01 Ryoshun Oba , Shin-ichi Tanigawa

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…

Metric Geometry · Mathematics 2017-09-27 Derek Kitson , Rupert H. Levene

We describe a very simple condition that is necessary for the universal rigidity of a complete bipartite framework $(K(n,m),p,q)$. This condition is also sufficient for universal rigidity under a variety of weak assumptions, such as general…

Metric Geometry · Mathematics 2016-10-14 Robert Connelly , Steven J. Gortler

We construct infinite periodic versions of the stress matrix and establish sufficient conditions for periodic tensegrity frameworks to be globally rigid in $\mathbb{R}^d$ in the cases when the lattice is either fixed, fully flexible, or…

Metric Geometry · Mathematics 2025-10-23 Sean Dewar , Bernd Schulze , Shin-ichi Tanigawa , Louis Theran

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

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…

Combinatorics · Mathematics 2024-09-12 Dániel Garamvölgyi , Tibor Jordán

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

Combinatorics · Mathematics 2018-05-22 A. Iosevich , J. Passant

Let $G$ be a graph with $n$ vertices, and $d$ be a target dimension. In this paper we study the set of rank $n-d-1$ matrices that are equilibrium stress matrices for at least one (unspecified) $d$-dimensional framework of $G$ in general…

Metric Geometry · Mathematics 2023-05-23 Robert Connelly , Steven J. Gortler , Louis Theran

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…

Combinatorics · Mathematics 2025-02-17 Oliver Clarke , Sean Dewar , Daniel Green Tripp , James Maxwell , Anthony Nixon , Yue Ren , Ben Smith

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…

Combinatorics · Mathematics 2012-07-09 Bill Jackson , J. C. Owen

We define periodic frameworks as graphs on the torus, using the language of gain graphs. We present some fundamental definitions and results about the infinitesimal rigidity of graphs on a torus of fixed size and shape, and find necessary…

Metric Geometry · Mathematics 2012-03-01 Elissa Ross

Some aspects of a mathematical theory of rigidity and flexibility are developed for general infinite frameworks and two main results are obtained. In the first sufficient conditions, of a uniform local nature, are obtained for the existence…

Functional Analysis · Mathematics 2008-11-19 J. C. Owen , S. C. Power

We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered.…

Combinatorics · Mathematics 2016-07-08 Bill Jackson , Viktoria Kaszanitzky , Anthony Nixon

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 $xy\in E$ in $(G,p)$ is the distance between $p(x)$ and $p(y)$. A vertex pair $\{u,v\}$ of $G$ is…

Combinatorics · Mathematics 2023-07-11 Tibor Jordán , Soma Villányi