Digital Chain Combinatorics
What Counting algorithms and data structures for discrete polyhedral chains.
Which allows numbers of constrained configurations to be computed and a way to express the invariants as efficient bit string operations

all loops of length 12

all loops of length 18

all canonical 226 (of 16M possible) loops of length 24
Why faster algorithms on digital material.
Who Jonathan Bachrach
How C++ and OpenGL
When 2011
Where Otherlab