Packing polyominoes clumsily
For a set D of polyominoes, a packing of the plane with D is a maximal set of copies of polyominoes from D that are not overlapping. A packing with smallest density is called a clumsy packing. We give an example of a set D such that any clumsy packing is aperiodic. In addition, we compute the smallest possible density of a clumsy packing when D consists of a single polyomino of a given size and show that one can always construct a periodic packing arbitrarily close in density to the clumsy packing.
packing polyominoes clumsy aperiodic sparse