Computing Minimum Tile Sets to Self-Assemble Color Patterns

DOI10.1007/978-3-642-45030-3_65zbMath1406.68117arXiv1404.2962OpenAlexW1551885387MaRDI QIDQ2872134

Aleck Johnsen, Shinnosuke Seki, Ming-Yang Kao

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.2962

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Erd?s problems and related topics of discrete geometry (52C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis ⋮ Binary pattern tile set synthesis is NP-hard ⋮ 3-color bounded patterned self-assembly ⋮ The Complexity of Fixed-Height Patterned Tile Self-assembly

This page was built for publication: Computing Minimum Tile Sets to Self-Assemble Color Patterns