Related papers: Particle-Based Assembly Using Precise Global Contr…
Self-assembly in the laboratory can now yield `information-rich' nanostructures in which each component is of a distinct type and has a defined spatial position. Ensuring the thermodynamic stability of such structures requires…
We present local distributed, stochastic algorithms for \emph{alignment} in self-organizing particle systems (SOPS) on two-dimensional lattices, where particles occupy unique sites on the lattice, and particles can make spatial moves to…
In programmable matter, we consider a large number of tiny, primitive computational entities called particles that run distributed algorithms to control global properties of the particle structure. Shape formation problems, where the…
Leader Election is an important primitive for programmable matter, since it is often an intermediate step for the solution of more complex problems. Although the leader election problem itself is well studied even in the specific context of…
Modeling membrane interactions with arbitrarily shaped colloidal particles, such as environmental micro- and nanoplastics, at the cell scale remains particularly challenging, owing to the complexity of particle geometries and the need to…
The creation of whole 3D objects in one shot is an ultimate goal for rapid prototyping, most notably biofabrication, where conventional methods are typically slow and apply mechanical or chemical stress on biological cells. Here, we…
The self-assembly of complex structures from engineered subunits is a major goal of nanotechnology, but controlling their size becomes increasingly difficult in larger assemblies. Existing strategies present significant challenges, among…
Algorithmic self-assembly, a generalization of crystal growth processes, has been proposed as a mechanism for autonomous DNA computation and for bottom-up fabrication of complex nanostructures. A `program' for growing a desired structure…
In this paper we theoretically investigate underlying assumptions that have been used for designing adaptive particle swarm optimization algorithms in the past years. We relate these assumptions to the movement patterns of particles…
We introduce Patchwork, a new general-purpose shape representation capable of modeling 2D and 3D geometry with a small number of parameters. Patchwork is grounded in a rigorous mathematical framework, providing provable complexity bounds…
We propose a general framework for solving inverse self-assembly problems, i.e. designing interactions between elementary units such that they assemble spontaneously into a predetermined structure. Our approach uses patchy particles as…
We study the classic sliding cube model for programmable matter under parallel reconfiguration in three dimensions, providing novel algorithmic and surprising complexity results in addition to generalizing the best known bounds from two to…
We introduce particle systems in one or more dimensions in which particles perform branching Brownian motion and the population size is kept constant equal to $N > 1$, through the following selection mechanism: at all times only the $N$…
In equilibrium self-assembly, microscopic building blocks spontaneously self-organize into stable structures as dictated by their interaction potentials, which limits the accessible structural features to those that correspond to global…
The ability to design and synthesize ever more complicated colloidal particles opens the possibility of self-assembling a zoo of complex structures, including those with one or more self-limited length scales. An undesirable feature of…
Most existing 3D assembly methods treat the problem as pure pose estimation, rearranging observed parts via rigid transformations. In contrast, human assembly naturally couples structural reasoning with holistic shape inference. Inspired by…
We propose a new model for the description of complex granular particles and their interaction in molecular dynamics simulations of granular material in two dimensions. The grains are composed of triangles which are connected by deformable…
We consider a one-dimensional discrete-space birth process with a bounded number of particle per site. Under the assumptions of the finite range of interaction, translation invariance, and non-degeneracy, we prove a shape theorem. We also…
Patchy particles have proven to be a prominent model for studying the self-assembly behavior of various systems, ranging from finite clusters to bulk crystal assemblies, and from synthetic colloidal particles to viruses. The patchy particle…
We report three-dimensional particle mechanics static calculations that predict the microstructure evolution during die-compaction of elastic spherical particles up to relative densities close to one. We employ a nonlocal contact…