Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes

DOI10.1007/978-3-642-03076-5_12zbMath1258.68055OpenAlexW2264541619MaRDI QIDQ3643099

Eric Rémila, Florent Becker, Nicolas Schabanel

Publication date: 10 November 2009

Published in: DNA Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03076-5_12

zbMATH Keywords

tilingsself-assembling2D and 3D discrete geometrytime optimal construction

Mathematics Subject Classification ID

Related Items (3)

Tile complexity of approximate squares ⋮ Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions ⋮ An introduction to tile-based self-assembly and a survey of recent results

Cites Work

• Unnamed Item
• The program-size complexity of self-assembled squares (extended abstract)
• Running time and program size for self-assembled squares
• Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
• DNA Computing

This page was built for publication: Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes