TY - GEN
T1 - Computing the number of realizations of a Laman graph
AU - Capco, Jose
AU - Grasegger, Georg
AU - Gallet, Matteo
AU - Koutschan, Christoph
AU - Lubbes, Niels
AU - Schicho, Josef
PY - 2017/8
Y1 - 2017/8
N2 - 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.
AB - 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.
UR - http://www.koutschan.de/data/laman
UR - https://www.scopus.com/pages/publications/85026775706
U2 - 10.1016/j.endm.2017.06.040
DO - 10.1016/j.endm.2017.06.040
M3 - Conference proceedings
VL - 61
T3 - Electronic notes in discrete mathematics
SP - 207
EP - 213
BT - Proceedings of Eurocomb 2017
A2 - Vadim Lozin, null
ER -