Difference between revisions of "Identifying Shapes Using Self-Assembly"
Jump to navigation
Jump to search
(Created page with "{{PaperTemplate |title=Identifying Shapes Using Self-Assembly (extended abstract) |abstract=In this paper, we introduce the following problem in the theory of algorithmic self-as...") |
m |
||
| (4 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
{{PaperTemplate | {{PaperTemplate | ||
| − | |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 | + | |date=2010/06/15 |
| + | |file=[http://arxiv.org/abs/1006.3046 Identifying Shapes Using Self-Assembly] | ||
}} | }} | ||
Latest revision as of 11:29, 22 June 2021
Published on: 2010/06/15
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
