Computing the number of realizations of a Laman graph

TL;DR

This paper summarizes a recursive method for counting the number of distinct planar realizations of Laman graphs, which are fundamental in modeling rigid frameworks, using algebraic and tropical geometry insights.

Contribution

It provides a concise summary of a recursive formula for counting realizations of Laman graphs, emphasizing combinatorial and geometric perspectives.

Findings

Recursive formula for counting realizations

Connection between algebraic and tropical geometry

Main ideas highlighted from previous detailed work

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.