An algorithm for deciding if a polyomino tiles the plane
Ian Gambini, Laurent Vuillon · RAIRO - Theoretical Informatics and Applications · 2007
For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate from algorithmics, discrete geometry and combinatorics on words.