Computing the number of realizations of a Laman graph
Combinatorics
2017-10-12 v2 Computational Geometry
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.
Keywords
Cite
@article{arxiv.1707.03633,
title = {Computing the number of realizations of a Laman graph},
author = {Jose Capco and Matteo Gallet and Georg Grasegger and Christoph Koutschan and Niels Lubbes and Josef Schicho},
journal= {arXiv preprint arXiv:1707.03633},
year = {2017}
}
Comments
Extended abstract; the long version is arxiv:1701.05500