GENERIC UNLABELED GLOBAL RIGIDITY
From MaRDI portal
Publication:5226556
DOI10.1017/fms.2019.16zbMath1420.51004arXiv1806.08688OpenAlexW3101956208MaRDI QIDQ5226556
Louis Theran, Steven J. Gortler, Dylan P. Thurston
Publication date: 1 August 2019
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.08688
Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) General theory of distance geometry (51K05) Configuration theorems in linear incidence geometry (51A20)
Related Items
Globally rigid graphs are fully reconstructible, Trilateration using unlabeled path or loop lengths, Graph reconstruction from unlabeled edge lengths, Global Rigidity of Unit Ball Graphs, \(K_{5, 5}\) is fully reconstructible in \(\mathbb{C}^3\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Slider-pinning rigidity: a Maxwell-Laman-type theorem
- Elementary structure of real algebraic varieties
- Global rigidity: The effect of coning
- Circuit preserving edge maps
- When is a bipartite graph a rigid framework?
- The red book of varieties and schemes. Includes the Michigan lectures (1974) on ``Curves and their Jacobians.
- Connected rigidity matroids and unique realizations of graphs
- On reconstructing \(n\)-point configurations from the distribution of distances or areas
- Graph reconstruction from unlabeled edge lengths
- Generic global rigidity
- ON AFFINE RIGIDITY
- Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
- The 2-dimensional rigidity of certain families of graphs
- Characterizing generic global rigidity
- Conditions for Unique Graph Realizations
- The Rigidity of Graphs
- 2-Isomorphic Graphs
- The Molecule Problem: Exploiting Structure in Global Optimization
- Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
- The rigidity transition in random graphs
- The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
- Algorithms in real algebraic geometry
