English
Related papers

Related papers: Self-Assembly of Shapes at Constant Scale using Re…

200 papers

We show how to design a universal shape replicator in a self-assembly system with both attractive and repulsive forces. More precisely, we show that there is a universal set of constant-size objects that, when added to any unknown hole-free…

Computational Geometry · Computer Science 2016-08-02 Cameron Chalk , Erik D. Demaine , Martin L. Demaine , Eric Martinez , Robert Schweller , Luis Vega , Tim Wylie

In this paper, we investigate the abilities of systems of self-assembling tiles which can each pass a constant number of signals to their immediate neighbors to create replicas of input shapes. Namely, we work within the Signal-passing Tile…

Emerging Technologies · Computer Science 2022-04-05 Andrew Alseth , Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers

The connection between self-assembly and computation suggests that a shape can be considered the output of a self-assembly ``program,'' a set of tiles that fit together to create a shape. It seems plausible that the size of the smallest…

Computational Complexity · Computer Science 2008-06-22 David Soloveichik , Erik Winfree

In this paper, we investigate shape-assembling power of a tile-based model of self-assembly called the Signal-Passing Tile Assembly Model (STAM). In this model, the glues that bind tiles together can be turned on and off by the binding…

Formal Languages and Automata Theory · Computer Science 2022-06-09 Andrew Alseth , Daniel Hader , Matthew J. Patitz

We consider a model of algorithmic self-assembly of geometric shapes out of square Wang tiles studied in SODA 2010, in which there are two types of tiles (e.g., constructed out of DNA and RNA material) and one operation that destroys all…

Computational Complexity · Computer Science 2010-07-09 Erik D. Demaine , Matthew J. Patitz , Robert T. Schweller , Scott M. Summers

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…

Computational Complexity · Computer Science 2010-06-16 Matthew J. Patitz , Scott M. Summers

In the abstract Tile Assembly Model, self-assembling systems consisting of tiles of different colors can form structures on which colored patterns are ``painted.'' We explore the complexity, in terms of the numbers of unique tile types…

Emerging Technologies · Computer Science 2024-03-12 Phillip Drake , Matthew J. Patitz , Scott M. Summers , Tyler Tracy

We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of programmable matter and self-assembly for building high-yield…

Data Structures and Algorithms · Computer Science 2017-09-20 Aaron T. Becker , Sándor P. Fekete , Phillip Keldenich , Dominik Krupke , Christian Rieck , Christian Scheffer , Arne Schmidt

Self-assembly is a process which is ubiquitous in natural, especially biological systems. It occurs when groups of relatively simple components spontaneously combine to form more complex structures. While such systems have inspired a large…

Computational Geometry · Computer Science 2018-07-19 Jerome Durand-Lose , Jacob Hendricks , Matthew J. Patitz , Ian Perkins , Michael Sharp

In this work we propose a generalization of Winfree's abstract Tile Assembly Model (aTAM) in which tile types are assigned rigid shapes, or geometries, along each tile face. We examine the number of distinct tile types needed to assemble…

Computational Geometry · Computer Science 2015-03-19 Bin Fu , Matthew J. Patitz , Robert T. Schweller , Bobby Sheline

We consider staged self-assembly systems, in which square-shaped tiles can be added to bins in several stages. Within these bins, the tiles may connect to each other, depending on the glue types of their edges. Previous work by Demaine et…

Data Structures and Algorithms · Computer Science 2017-01-03 Erik D. Demaine , Sándor P. Fekete , Christian Scheffer , Arne Schmidt

This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models. The journey begins with the result that there is a single…

Computational Geometry · Computer Science 2013-09-06 Damien Woods

We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model and its various constraints and performance measures are…

Computational Geometry · Computer Science 2008-03-04 Erik D. Demaine , Martin L. Demaine , Sandor P. Fekete , Mashhood Ishaque , Eynat Rafalin , Robert T. Schweller , Diane Souvaine

The emerging field of passive macro-scale tile-based self-assembly (TBSA) shows promise in enabling effective manufacturing processes by harnessing TBSA's intrinsic parallelism. However, current TBSA methodologies still do not fulfill their…

Robotics · Computer Science 2022-06-09 M. Jílek , K. Stránská , M. Somr , M. Kulich , J. Zeman , L. Přeučil

We introduce a new model of algorithmic tile self-assembly called size-dependent assembly. In previous models, supertiles are stable when the total strength of the bonds between any two halves exceeds some constant temperature. In this…

Computational Geometry · Computer Science 2015-09-24 Sándor P. Fekete , Robert T. Schweller , Andrew Winslow

We prove a Pumping Lemma for the noncooperative abstract Tile Assembly Model, a model central to the theory of algorithmic self-assembly since the beginning of the field. This theory suggests, and our result proves, that small differences…

Computational Complexity · Computer Science 2020-02-11 Pierre-Étienne Meunier , Damien Regnault , Damien Woods

In this paper we explore the power of tile self-assembly models that extend the well-studied abstract Tile Assembly Model (aTAM) by permitting tiles of shapes beyond unit squares. Our main result shows the surprising fact that any aTAM…

Data Structures and Algorithms · Computer Science 2012-12-20 Erik D. Demaine , Martin L. Demaine , Sándor P. Fekete , Matthew J. Patitz , Robert T. Schweller , Andrew Winslow , Damien Woods

In micro- and nano-scale systems, particles can be moved by using an external force like gravity or a magnetic field. In the presence of adhesive particles that can attach to each other, the challenge is to decide whether a shape is…

Computational Geometry · Computer Science 2022-06-16 Jakob Keller , Christian Rieck , Christian Scheffer , Arne Schmidt

In this paper we present a model containing modifications to the Signal-passing Tile Assembly Model (STAM), a tile-based self-assembly model whose tiles are capable of activating and deactivating glues based on the binding of other glues.…

Emerging Technologies · Computer Science 2022-03-30 Andrew Alseth , Daniel Hader , Matthew J. Patitz

We prove that by successively combining subassemblies, we can achieve sublinear construction times for "staged" assembly of micro-scale objects from a large number of tiny particles, for vast classes of shapes; this is a significant advance…

Computational Geometry · Computer Science 2018-07-05 Arne Schmidt , Sheryl Manzoor , Li Huang , Aaron T. Becker , Sándor P. Fekete
‹ Prev 1 2 3 10 Next ›