Corresponding author: Iiro Honkala (

Academic editor:

Given a finite set of patterns, i.e., subsets of . What is the best way to place translates of them in such a way that every point belongs to at least one translate and no two points belong to the same set of translates? We give some general results, and investigate the particular case when there is only a single pattern and that pattern is a square or has size at most four.