The number of realizations of a Laman graph

Abstract

Laman graphs model planar frameworks that are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. Such realizations can be seen as solutions of systems of quadratic equations prescribing the distances between pairs of points. Using ideas from algebraic and tropical geometry, we provide a recursive formula for the number of complex solutions of such systems.

36 pages

References in corpus (3)

• Enumerative tropical algebraic geometry in R2
• Computing Algebraic Matroids
• Computing the number of realizations of a Laman graph

Cited by in corpus (13)

• Branches of triangulated origami near the unfolded state
• Graphs with Flexible Labelings allowing Injective Realizations
• Counting realizations of Laman graphs on the sphere
• Globally rigid graphs are fully reconstructible
• On the maximal number of real embeddings of minimally rigid graphs in ${\mathbb{R}}^2$, ${\mathbb{R}}^3$ and $S^2$
• On the maximal number of real embeddings of spatial minimally rigid graphs
• Computing the number of realizations of a Laman graph
• Coupler curves of moving graphs and counting realizations of rigid graphs
• Irreducible components of sets of points in the plane that satisfy distance conditions
• The number of realisations of a rigid graph in Euclidean and spherical geometries
• The algebraic matroid of the funtf variety
• Realizations of Rigid Graphs
• Dilworth truncations and Hadamard products of linear spaces