Minimum boundary touching tilings of polyominoes

DOI10.1002/malq.200510015zbMath1089.68133OpenAlexW1977537695MaRDI QIDQ3376538

Andreas Spillner

Publication date: 24 March 2006

Published in: MLQ (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200510015

zbMATH Keywords

algorithmcomputational complexitycomputational geometrydecision problempolyominosquare tiling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Cites Work

• Algorithm Theory - SWAT 2004

This page was built for publication: Minimum boundary touching tilings of polyominoes