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

DOI10.1007/11944836_7zbMath1162.68466MaRDI 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

68Q25: Analysis of algorithms and problem complexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68Q42: Grammars and rewriting systems

52C20: Tilings in (2) dimensions (aspects of discrete geometry)

Related Items

Parallel Computation Using Active Self-assembly, Unnamed Item, Parallelism and Time in Hierarchical Self-Assembly, An introduction to tile-based self-assembly and a survey of recent results, Program size and temperature in self-assembly, Concentration independent random number generation in tile self-assembly, Self-assembly of decidable sets, Self-assembly of infinite structures: a survey, Pictures worth a thousand tiles, a geometrical programming language for self-assembly, Tile complexity of approximate squares, 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, Reducing tile complexity for the self-assembly of scaled shapes through temperature programming, Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly, Randomized Self Assembly of Rectangular Nano Structures, Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes