Laman graphs model planar frameworks that 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. Such realizations can be seen as solutions of systems of quadratic equations prescribing the distances between pairs of points. Using ideas from algebraic and tropical geometry, we provide a recursion formula for the number of complex solutions of such systems.
Sprache der Kurzfassung:
Englisch
Veröffentlicher:
RISC, JKU
Verlagsanschrift:
Hagenberg, Linz
Serie:
RISC Report Series, Johannes Kepler University Linz, Austria
Forschungs-