Equivalent realisations of a rigid graph
From MaRDI portal
Publication:1728093
DOI10.1016/j.dam.2017.12.009zbMath1405.05037arXiv1204.1228OpenAlexW2784208434MaRDI QIDQ1728093
Publication date: 21 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.1228
Planar graphs; geometric and topological aspects of graph theory (05C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Graph theory (05C99)
Related Items (10)
The m-Bézout bound and distance geometry ⋮ The Number of Realizations of a Laman Graph ⋮ New upper bounds for the number of embeddings of minimally rigid graphs ⋮ Counting realizations of Laman graphs on the sphere ⋮ Coupler curves of moving graphs and counting realizations of rigid graphs ⋮ Lower Bounds on the Number of Realizations of Rigid Graphs ⋮ On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\) ⋮ On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs ⋮ Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces ⋮ One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LamanGraphs
- Mixed volume techniques for embeddings of Laman graphs
- The rigidity of graphs. II
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Computing the number of realizations of a Laman graph
- Connected rigidity matroids and unique realizations of graphs
- The number of embeddings of minimally rigid graphs
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Generic global rigidity
- Globally linked pairs of vertices in equivalent realizations of graphs
- On graphs and rigidity of plane skeletal structures
- Mixed Volume and Distance Geometry Techniques for Counting Euclidean Embeddings of Rigid Graphs
- The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
- The non-solvability by radicals of generic 3-connected planar Laman graphs
- Characterizing generic global rigidity
- On Generic Rigidity in the Plane
- Conditions for Unique Graph Realizations
- Randomized Embeddings with Slack and High-Dimensional Approximate Nearest Neighbor
- Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
- 1-EXTENSIONS AND GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Counting the Number of Solutions of KDMDGP Instances
- Algorithms – ESA 2004
- Algorithms - ESA 2003
This page was built for publication: Equivalent realisations of a rigid graph