Difference between revisions of "Identifying Shapes Using Self-Assembly"
Jump to navigation
Jump to search
m (moved Identifying Shapes Using Self-Assembly (extended abstract) to Identifying Shapes Using Self-Assembly: This links to the full, Algorithmica version rather than the extended abstract of ISAAC.) |
Wiki admin (talk | contribs) |
||
| Line 2: | Line 2: | ||
|title=Identifying Shapes Using Self-Assembly | |title=Identifying Shapes Using Self-Assembly | ||
|abstract=In this paper, we introduce the following problem in the theory of algorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify whether or not the given input shape--drawn from a very general class of shapes--matches a particular target shape. We first study the complexity of correctly identifying squares. Then we investigate the complexity associated with the identification of a considerably more general class of non-square, hole-free shapes. | |abstract=In this paper, we introduce the following problem in the theory of algorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify whether or not the given input shape--drawn from a very general class of shapes--matches a particular target shape. We first study the complexity of correctly identifying squares. Then we investigate the complexity associated with the identification of a considerably more general class of non-square, hole-free shapes. | ||
| − | |authors=Matthew J. Patitz | + | |authors=Matthew J. Patitz, Scott M. Summers |
|file=[http://arxiv.org/abs/1006.3046 Arxiv page] | |file=[http://arxiv.org/abs/1006.3046 Arxiv page] | ||
}} | }} | ||
Revision as of 13:58, 23 January 2012
Published on:
Abstract
In this paper, we introduce the following problem in the theory of algorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify whether or not the given input shape--drawn from a very general class of shapes--matches a particular target shape. We first study the complexity of correctly identifying squares. Then we investigate the complexity associated with the identification of a considerably more general class of non-square, hole-free shapes.
Authors
Matthew J. Patitz, Scott M. Summers
