Sciweavers

ITA
2007

An algorithm for deciding if a polyomino tiles the plane

13 years 3 months ago
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.
Ian Gambini, Laurent Vuillon
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where ITA
Authors Ian Gambini, Laurent Vuillon
Comments (0)