Generically globally rigid graphs have generic universally rigid frameworks
From MaRDI portal
Publication:2182252
DOI10.1007/s00493-018-3694-4zbMath1463.52016arXiv1604.07475OpenAlexW3013929905MaRDI QIDQ2182252
Steven J. Gortler, Louis Theran, Robert Connelly
Publication date: 22 May 2020
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.07475
Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Global rigidity of (quasi-)injective frameworks on the line ⋮ Global rigidity of triangulations with braces ⋮ Characterizing the universal rigidity of generic tensegrities ⋮ On the global rigidity of tensegrity graphs ⋮ \(K_{5, 5}\) is fully reconstructible in \(\mathbb{C}^3\) ⋮ Minimally globally rigid graphs
Cites Work
- Graph connectivity and universal rigidity of bar frameworks
- Universal rigidity of complete bipartite graphs
- Characterizing the universal rigidity of generic frameworks
- On the ideal of orthogonal representations of a graph in \(\mathbb{R}^2\)
- Elementary structure of real algebraic varieties
- Theory of semidefinite programming for sensor network localization
- Operations preserving the global rigidity of graphs and frameworks in the plane
- Global rigidity: The effect of coning
- The rigidity of graphs. II
- Rigidity and energy
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- A correction: Orthogonal representations and connectivity of graphs
- Interior-point methods
- Connected rigidity matroids and unique realizations of graphs
- Orthogonal representations and connectivity of graphs
- Connections between the real positive semidefinite and distance matrix completion problems
- The geometry of graphs and some of its algorithmic applications
- On affine motions and bar frameworks in general position
- Generic global rigidity
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- Characterizing generic global rigidity
- Conditions for Unique Graph Realizations
- The Rigidity of Graphs
- Linear Sections of Determinantal Varieties
- Smooth points of a semialgebraic set
- The Molecule Problem: Exploiting Structure in Global Optimization
- Semidefinite Programming
- Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
- Euclidean Distance Geometry and Applications
- Algorithms in real algebraic geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
