Computing the number of realizations of a Laman graph
arXiv:1707.03633 · doi:10.1016/j.endm.2017.06.040
Abstract
Laman graphs model planar frameworks which 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. In a recent paper we provide a recursion formula for this number of realizations using ideas from algebraic and tropical geometry. Here, we present a concise summary of this result focusing on the main ideas and the combinatorial point of view.
Extended abstract; the long version is arxiv:1701.05500