3 search results - page 1 / 1 » Combinatorially Regular Polyomino Tilings |
DCG
2006
13 years 11 months ago
2006
DGCI
2009
Springer
14 years 2 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
EJC
2007
13 years 10 months ago
2007
: We show that the complexity of a cutting word u in a regular tiling by a polyomino Q is equal to Pn(u) = (p+q−1)n+1 for all n ≥ 0, where Pn(u) counts the number of distinct f...