author = {Jose Capco and Georg Grasegger and Matteo Gallet and Christoph Koutschan and Niels Lubbes and Josef Schicho},
title = {{Computing the number of realizations of a Laman graph}},
booktitle = {{Electronic Notes in Discrete Mathematics (Proceedings of Eurocomb 2017)}},
language = {english},
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.},
volume = {61},
pages = {207--213},
isbn_issn = {ISSN 1571-0653},
year = {2017},
editor = {Vadim Lozin},
refereed = {yes},
keywords = {Laman graph; minimally rigid graph; tropical geometry; euclidean embedding; graph realization},
length = {7},
conferencename = {The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17)},
url = {http://www.koutschan.de/data/laman/}