English
Related papers

Related papers: Frameworks with coordinated edge motions

200 papers

A $d$-dimensional tensegrity framework $(T,p)$ is an edge-labeled geometric graph in ${\mathbb R}^d$, which consists of a graph $T=(V,B\cup C\cup S)$ and a map $p:V\to {\mathbb R}^d$. The labels determine whether an edge $uv$ of $T$…

Combinatorics · Mathematics 2024-10-11 Adam D. W. Clay , Tibor Jordán , Sára Hanna Tóth

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…

Metric Geometry · Mathematics 2014-06-05 Derek Kitson , Bernd Schulze

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…

Metric Geometry · Mathematics 2016-05-26 Bill Jackson , J. C. Owen

A one-to-one correspondence between the infinitesimal motions of bar-joint frameworks in $\mathbb{R}^d$ and those in $\mathbb{S}^d$ is a classical observation by Pogorelov, and further connections among different rigidity models in various…

As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset…

Combinatorics · Mathematics 2011-09-06 Naoki Katoh , Shin-ichi Tanigawa

A longstanding problem in rigidity theory is to characterize the graphs which are minimally generically rigid in 3-space. The results of Cauchy, Dehn, and Alexandrov give one important class: the triangulated convex spheres, but there is an…

Metric Geometry · Mathematics 2010-07-07 Wendy Finbow-Singh , Walter Whiteley

In "Universal rigidity on the line, point orde" it is shown, answering a question of Jord\'an and Nguyen, that universal rigidity of a generic bar-joint framework in R^1 depends on more than the ordering of the vertices. The graph G that…

Metric Geometry · Mathematics 2022-07-19 Bryan Chen , Robert Connelly , Steven J. Gortler , Anthony Nixon , Louis Theran

A two-dimensional direction-length framework $(G,p)$ consists of a multigraph $G=(V;D,L)$ whose edge set is formed of "direction" edges $D$ and "length" edges $L$, and a realisation $p$ of this graph in the plane. The edges of the framework…

Combinatorics · Mathematics 2016-08-31 Katie Clinch

A configuration p in r-dimensional Euclidean space is a finite collection of points (p^1,...,p^n) that affinely span R^r. A bar framework, denoted by G(p), in R^r is a simple graph G on n vertices together with a configuration p in R^r. A…

Metric Geometry · Mathematics 2010-09-20 A. Y. Alfakih , Yinyu Ye

A result due in its various parts to Hendrickson, Connelly, and Jackson and Jord\'an, provides a purely combinatorial characterisation of global rigidity for generic bar-joint frameworks in $\mathbb{R}^2$. The analogous conditions are known…

Metric Geometry · Mathematics 2013-06-12 Bill Jackson , Thomas McCourt , Anthony Nixon

The mathematical theory of rigidity of body-bar and body-hinge frameworks provides a useful tool for analyzing the rigidity and flexibility of many articulated structures appearing in engineering, robotics and biochemistry. In this paper we…

Metric Geometry · Mathematics 2014-02-04 Bernd Schulze , Shin-ichi Tanigawa

Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1 \leq r \leq n-2$, then there exists a configuration $p$ in general position in $R^r$ such that the bar framework $(G,p)$ is universally…

Metric Geometry · Mathematics 2014-08-18 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

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…

Metric Geometry · Mathematics 2024-01-18 Sean Dewar

A crystallographic bar-joint framework C is shown to be almost periodically infinitesimally rigid if and only if it is strictly periodically infinitesimally rigid and the rigid unit mode (RUM) spectrum is a singleton. Moreover the almost…

Metric Geometry · Mathematics 2014-02-26 G. Badri , D. Kitson , S. C. Power

In this paper we consider the effect of symmetry on the rigidity of bar-joint frameworks, spherical frameworks and point-hyperplane frameworks in $\mathbb{R}^d$. In particular we show that, under forced or incidental symmetry, infinitesimal…

Combinatorics · Mathematics 2019-06-07 Katie Clinch , Anthony Nixon , Bernd Schulze , Walter Whiteley

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…

Computational Geometry · Computer Science 2017-01-26 Ioannis Z. Emiris , Ioannis Psarros

We present necessary and sufficient conditions for the generic rigidity of body-bar frameworks on the three-dimensional fixed torus. These frameworks correspond to infinite periodic body-bar frameworks in $\mathbb{R}^3$ with a fixed…

Metric Geometry · Mathematics 2014-03-05 Elissa Ross

Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…

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

We study the rigidity of body-and-cad frameworks which capture the majority of the geometric constraints used in 3D mechanical engineering CAD software. We present a combinatorial characterization of the generic minimal rigidity of a subset…

Discrete Mathematics · Computer Science 2012-10-19 Audrey Lee-St. John , Jessica Sidman