4 citations · 4 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023
Calligraphs and sphere realizations
Matteo Gallet, Georg Grasegger, Niels Lubbes +1
We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredient…
math.CO2017★ 4 cited
Computing the number of realizations of a Laman graph
Jose Capco, Matteo Gallet, Georg Grasegger +3
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 grap…