New geometric algorithms for fully connected staged self-assembly
From MaRDI portal
Publication:529018
DOI10.1016/j.tcs.2016.11.020zbMath1370.68089arXiv1505.07862OpenAlexW2550502650MaRDI QIDQ529018
Erik D. Demaine, Arne Schmidt, Christian Scheffer, Sándor P. Fekete
Publication date: 18 May 2017
Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.07862
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (11)
Self-assembly of shapes at constant scale using repulsive forces ⋮ Verification in staged tile self-assembly ⋮ Unique assembly verification in two-handed self-assembly ⋮ CADbots: algorithmic aspects of manipulating programmable matter with finite automata ⋮ Tilt assembly: algorithms for micro-factories that build objects with uniform external forces ⋮ Optimal staged self-assembly of general shapes ⋮ New geometric algorithms for fully connected staged self-assembly ⋮ Forming tile shapes with simple robots ⋮ Particle-based assembly using precise global control ⋮ Optimal staged self-assembly of linear assemblies ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New geometric algorithms for fully connected staged self-assembly
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- Hierarchical self assembly of patterns from the Robinson tilings: DNA tile design in an enhanced tile assembly model
- Self-assembly with Geometric Tiles
- ASYNCHRONOUS SIGNAL PASSING FOR TILE SELF-ASSEMBLY: FUEL EFFICIENT COMPUTATION AND EFFICIENT ASSEMBLY OF SHAPES
- The program-size complexity of self-assembled squares (extended abstract)
- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
- Complexities for Generalized Models of Self-Assembly
- Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly
This page was built for publication: New geometric algorithms for fully connected staged self-assembly