An interesting article on finding algorithms for self-assembling, nano-scale polyhedra.  Related to some things I’m thinking about in the studio at the moment, the process seems quite interesting/complicated.  Researchers “determined the best 2-D arrangements, called planar nets, to create self-folding polyhedra with dimensions of a few hundred microns, the size of a small dust particle. … Continue reading Algorithms for Self-Assembly