28 citations · 110 across the 30 of their papers we have counts for
3 papers · 1 filter
Lower bounds on the number of realizations of rigid graphs
Georg Grasegger, Christoph Koutschan, Elias Tsigaridas
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take adv…
Graphs with Flexible Labelings
Georg Grasegger, Jan Legerský, Josef Schicho
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinator…
The number of realizations of a Laman graph
Jose Capco, Matteo Gallet, Georg Grasegger +3
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…