Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time

DOI10.1007/11944836_7zbMath1162.68466OpenAlexW1604076830MaRDI QIDQ5385972

Ivan Rapaport, Florent Becker, Eric Rémila

Publication date: 17 April 2008

Published in: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11944836_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Grammars and rewriting systems (68Q42) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items

The complexity of multiple handed self-assembly ⋮ Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly ⋮ Self-assembly of infinite structures: a survey ⋮ Reducing tile complexity for the self-assembly of scaled shapes through temperature programming ⋮ Tile complexity of approximate squares ⋮ Program size and temperature in self-assembly ⋮ Concentration independent random number generation in tile self-assembly ⋮ Parallel Computation Using Active Self-assembly ⋮ Fast arithmetic in algorithmic self-assembly ⋮ Parallel computation using active self-assembly ⋮ Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles ⋮ Parallelism and Time in Hierarchical Self-Assembly ⋮ Self-assembly of decidable sets ⋮ Randomized Self Assembly of Rectangular Nano Structures ⋮ Pictures worth a thousand tiles, a geometrical programming language for self-assembly ⋮ Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes ⋮ Unnamed Item ⋮ An introduction to tile-based self-assembly and a survey of recent results