Computing the number of realizations of a Laman graph

07/12/2017
by   Jose Capco, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset