25 search results - page 2 / 5 » Tiling a Rectangle with Polyominoes |
EJC
2007
13 years 7 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper provides a bridge between the classical tiling theory and cellular automata on one side, and the complex neighborhood self-assembling situations that exist in practice,...
DGCI
2009
Springer
13 years 11 months ago
2009
Springer
Among the polyominoes that tile the plane by translation, the so-called squares have been conjectured to tile the plane in at most two distinct ways (these are called double square...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this work, we present a new method for generating a threshold structure. This kind of structure can be advantageously used in various halftoning algorithms such as clustered-do...
COCOON
2010
Springer
14 years 11 days ago
2010
Springer
The main purpose of this paper is to introduce the idea of tatami tilings, and to present some of the many interesting and fun questions that arise when studying them. Roughly spea...