Using Computation to Self-Assemble Patterns

Self-assembly is the process during which a collection of relatively simple components, starting in a disorganized state, autonomously combine into a more complex structure. During self-assembly, there is no external guidance or direction, and the self-assembling components experience only local interactions and typically obey a simple set of rules that govern how they combine.

We study, and demonstrate, how even simple mathematical formulas can be used to design sets of self-assembling tiles so that they form complex patterns, both periodic and aperiodic.

This booth is brought to you by members of the Electrical Engineering and Computer Science Department: http://self-assembly.net/mpatitz/

Videos:

• A video introducing algorithmic self-assembly:
  • https://vimeo.com/54214122

Additional Resources:

• A wiki covering basic definitions of mathematical models of self-assembling systems and describing several important results in algorithmic self-assembly:
  • http://self-assembly.net/wiki/index.php/Main_Page
• A web-based simulator that can be used to design self-assembling systems and watch them grow:
  • http://self-assembly.net/software/WebTAS/WebTAS-latest/