3 papers
cs.DS2020
Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D
David Furcy, Scott M. Summers, Logan Withers
We investigate a fundamental question regarding a benchmark class of shapes in one of the simplest, yet most widely utilized abstract models of algorithmic tile self-assembly. Spec…
cs.CG2014
Optimal program-size complexity for self-assembly at temperature 1 in 3D
David Furcy, Samuel Micka, Scott M. Summers
Working in a three-dimensional variant of Winfree's abstract Tile Assembly Model, we show that, for all , there is a tile set that uniquely self-assembles into an…
cs.CG2014
Scaled pier fractals do not strictly self-assemble
David Furcy, Scott M. Summers
A \emph{pier fractal} is a discrete self-similar fractal whose generator contains at least one \emph{pier}, that is, a member of the generator with exactly one adjacent point. Tree…