programmable-matter

This undergraduate honors thesis treats the problem of compression in self-organizing particle systems, where the goal is to gather particles as tightly together as possible. Three algorithms are proposed and compared with rigorous proofs and simulations.

In this undergraduate thesis defense, I give three algorithms for compression in the amoebot model: local compression, hole elimination, and $\alpha$-compression. Formal analysis and simulations are presented.