An algorithm for deciding if a polyomino tiles the plane

: 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.

• Type: Journal
• Year: 2007
• Where: ITA
• Authors: Ian Gambini, Laurent Vuillon
• Keywords: Algorithm, Boundary Length, Boundary Word, Communications, ITA 2007