Computing the number of realisations of a rigid graph

Sean Dewar, Georg Grasegger, Josef Schicho +2

A graph is said to be rigid if, given a generic realisation of the graph as a bar-and-joint framework in the plane, there exist only finitely many other realisations of the graph w…