An algorithm for deciding if a polyomino tiles the plane

Ian Gambini, Laurent Vuillon
2007 RAIRO - Theoretical Informatics and Applications  
For polyominoes coded by their boundary word, we describe a quadratic O(n 2 ) algorithm in the boundary length n which improves the naive O(n 4 ) algorithm. Techniques used emanate from algorithmics, discrete geometry and combinatorics on words. Mathematics Subject Classification. 68R15, 52C20.
doi:10.1051/ita:2007012 fatcat:3pz5wfvonjcypjknq2hjl4t7ay