Skip to Main content Skip to Navigation
Journal articles

On the tiling by translation problem

Abstract : On square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes that tile the plane by translation are characterized by the Beauquier-Nivat condition. By using the constant time algorithms for computing the longest common extensions in two words, we provide a linear time algorithm in the case of pseudo-square polyominoes, improving the previous quadratic algorithm of Gambini and Vuillon. We also have a linear algorithm for pseudo-hexagon polyominoes not containing arbitrarily large square factors. The results are extended to more general tiles.
Document type :
Journal articles
Complete list of metadata
Contributor : Xavier Provençal <>
Submitted on : Monday, June 15, 2009 - 11:49:09 AM
Last modification on : Wednesday, October 14, 2020 - 4:16:42 AM




Srecko Brlek, Xavier Provençal, Jean-Marc Fédou. On the tiling by translation problem. Discrete Applied Mathematics, Elsevier, 2008, 157 (3), pp.464-475. ⟨10.1016/j.dam.2008.05.026⟩. ⟨hal-00395229⟩



Record views