3 search results - page 1 / 1 » Tiling the Plane with a Fixed Number of Polyominoes |
LATA
2009
Springer
14 years 13 days ago
2009
Springer
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Domino problem. In this paper, we prove that the problem remains undecidable if t...
COMBINATORICS
2006
13 years 5 months ago
2006
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes that tile the plane by translation: a polyomino tiles the plane by translation...
CORR
2008
Springer
13 years 5 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...