The number of embeddings of minimally rigid graphs
From MaRDI portal
Publication:1880218
DOI10.1007/s00454-003-2902-0zbMath1050.05030arXivmath/0207126OpenAlexW2026588045WikidataQ56813977 ScholiaQ56813977MaRDI QIDQ1880218
Ileana Streinu, Ciprian S. Borcea
Publication date: 22 September 2004
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0207126
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (32)
The m-Bézout bound and distance geometry ⋮ Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials ⋮ Rigidity, Graphs and Hausdorff Dimension ⋮ Volume Frameworks and Deformation Varieties ⋮ Symmetries of the positive semidefinite cone ⋮ Generic Symmetry-Forced Infinitesimal Rigidity: Translations and Rotations ⋮ 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 ⋮ Radically solvable graphs ⋮ Computing the number of realizations of a Laman graph ⋮ Frameworks with crystallographic symmetry ⋮ Finite point configurations in the plane, rigidity and Erdős problems ⋮ Computing Circuit Polynomials in the Algebraic Rigidity Matroid ⋮ 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\) ⋮ Equivalent realisations of a rigid graph ⋮ Periodic frameworks and flexibility ⋮ Algorithm 951 ⋮ The algebraic matroid of the finite unit norm tight frame (funtf) variety ⋮ A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs ⋮ The algebro-geometric study of range maps ⋮ Rigidity, global rigidity, and graph decomposition ⋮ A computational solution to a question by Beauville on the invariants of the binary quintic ⋮ Enumerating Rigid Sphere Packings ⋮ Algebraic Matroids in Action ⋮ Mixed volume techniques for embeddings of Laman graphs ⋮ \(K_{5, 5}\) is fully reconstructible in \(\mathbb{C}^3\) ⋮ One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory ⋮ Liftings and stresses for planar periodic frameworks ⋮ An asymptotic upper bound for graph embeddings
This page was built for publication: The number of embeddings of minimally rigid graphs
