2D Pebble Game with Central Forces
The percolation of rigidity in 2D central-force networks with no special symmetries (generic networks) can be analyzed exactly using the 2D Pebble Game Fortran Code, which can be downloaded (follow the download link in the left-hand menu). The development of this routines was originally due to D.J. Jacobs and M.F. Thorpe [1,2], with subsequent input from Mykyta Chubynsky. Using three pebbles, the program finds the total number of floppy modes; decomposes the network into unique rigid clusters and identifies those parts of the rigid clusters that are over-constrained or stressed.

The downloadable code comes with a test example (test.f), which describes how to initialize the parameters, build the network and call the subroutines, so you can verify, learn and see how a starting floppy network becomes rigid and eventually stressed by the continued addition of constraints to the network (which can be done by un-commenting some lines described in the program test.f).
Download the Source Code
2dpebble.tar.gz
Files available for download.
Download a brief description of the 2D pebble game algorithm.
2D_CF_description.pdf
 
Powered by MySQL Powered by PHP Powered by Swish-e Fulton School of Engineering - High Performace Computing Initiative