COUNTING FOR RIGIDITY, FLEXIBILITY AND EXTENSIONS VIA THE PEBBLE GAME ALGORITHM
Adnan Sljoka · 2006
In rigidity theory, specifically combinatorial rigidity, one can simply count vertices and edges (constraints) in a graph to determine the rigidity and flexibility of a corresponding framework. The 6|V | − 6 counting condition for 3D, through the molecular conjecture by Tay and Whiteley, and a fast ‘pebble game ’ algorithm which tracks the underlying count in the multigraph, have led to the development of the program