English
Related papers

Related papers: Globally Rigid Convex Braced Polygons

200 papers

We survey the main extensions of the classical Hadamard, Liebmann and Cohn-Vossen rigidity theorems on convex surfaces of $3$-Euclidean space to the context of convex hypersurfaces of Riemannian manifolds. The results we present include the…

Differential Geometry · Mathematics 2023-02-03 Ronaldo Freire de Lima

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

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

We review some recent results in the generic rigidity theory of planar frameworks with forced symmetry, giving a uniform treatment to the topic. We also give new combinatorial characterizations of minimally rigid periodic frameworks with…

Geometric Topology · Mathematics 2012-03-06 Justin Malestein , Louis Theran

The combinatorial characterization of generic rigidity for bar-joint frameworks in dimensions $d \ge 3$ has been a long-standing open problem in discrete geometry. While the two-dimensional case was resolved in 1927 by Pollaczek-Geiringer…

Combinatorics · Mathematics 2026-04-21 Alexander Heaton

A d-dimensional framework is a graph and a map from its vertices to E^d. Such a framework is globally rigid if it is the only framework in E^d with the same graph and edge lengths, up to rigid motions. For which underlying graphs is a…

Metric Geometry · Mathematics 2021-10-13 Steven J. Gortler , Alexander D. Healy , Dylan P. Thurston

A $d$-dimensional bar-and-joint framework $(G,p)$ with underlying graph $G$ is called universally rigid if all realizations of $G$ with the same edge lengths, in all dimensions, are congruent to $(G,p)$. A graph $G$ is said to be…

Combinatorics · Mathematics 2025-02-07 Guilherme Zeus Dantas e Moura , Tibor Jordán , Corwin Silverman

The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed…

Differential Geometry · Mathematics 2007-05-23 Robert Connelly , Jean-Marc Schlenker

We show the rigidity of the hexagonal Delaunay triangulated plane under Luo's PL conformality. As a consequence, we obtain a rigidity theorem for a particular type of locally finite convex ideal hyperbolic polyhedra.

Geometric Topology · Mathematics 2020-05-06 Song Dai , Huabin Ge , Shiguang Ma

We prove that universal second-order rigidity implies universal prestress stability and that triangulated convex polytopes in three-space (with holes appropriately positioned) are prestress stable.

Metric Geometry · Mathematics 2017-12-08 Robert Connelly , Steven J. Gortler

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…

Metric Geometry · Mathematics 2019-08-26 Anthony Nixon , Stephen Power

In this paper we develop the compactness theorem for $\lambda$-surface in $\mathbb R^3$ with uniform $\lambda$, genus, and area growth. This theorem can be viewed as a generalization of Colding-Minicozzi's compactness theorem for…

Differential Geometry · Mathematics 2018-12-07 Ao Sun

Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the…

Combinatorics · Mathematics 2016-09-02 Kira Adaricheva , Madina Bolat

A simple graph G=(V,E) is 3-rigid if its generic bar-joint frameworks in R3 are infinitesimally rigid. Block and hole graphs are derived from triangulated spheres by the removal of edges and the addition of minimally rigid subgraphs, known…

Combinatorics · Mathematics 2015-07-10 James Cruickshank , Derek Kitson , Stephen Power

For plane frameworks with reflection or rotational symmetries, where the group action is not necessarily free on the vertex set, we introduce a phase-symmetric orbit rigidity matrix for each irreducible representation of the group. We then…

Combinatorics · Mathematics 2024-07-19 Alison La Porta , Bernd Schulze

We give a short proof of a result of Jordan and Tanigawa that a 4-connected graph which has a spanning planar triangulation as a proper subgraph is generically globally rigid in R^3. Our proof is based on a new sufficient condition for the…

Combinatorics · Mathematics 2022-03-22 James Cruickshank , Bill Jackson , Shin-ichi Tanigawa

Choice of an appropriate (3+1)-foliation of spacetime or a (2+1)-foliation of the Cauchy space, leads often to a substantial simplification of various mathematical problems in General Relativity Theory. We propose a new method to construct…

General Relativity and Quantum Cosmology · Physics 2013-08-22 Hans-Peter Gittel , Jacek Jezierski , Jerzy Kijowski , Szymon Łȩski

It is known that the space of convex polygons in the Euclidean plane with fixed normals, up to homotheties and translations, endowed with the area form, is isometric to a hyperbolic polyhedron. In this note we show a class of convex…

Differential Geometry · Mathematics 2013-04-05 François Fillastre

We show that universal rigidity of a generic bar and joint framework (G,p) in the line depends on more than the ordering of the vertices. In particular, we construct examples of one-dimensional generic frameworks with the same graph and…

Combinatorics · Mathematics 2021-04-06 Bryan Chen , Robert Connelly , Anthony Nixon , Louis Theran

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…

Combinatorics · Mathematics 2024-04-26 Georg Grasegger , Jan Legerský