Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1051/ita:2007012 | RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS |
Keywords | Field | DocType |
polyominoes,tiling the plane by translation,theorem of Beauquier-Nivat,pseudo-square,pseudo-hexagon,enumeration of special classes of polyominoes | Discrete geometry,Discrete mathematics,Combinatorics,Algorithmics,Polyomino,Enumeration,Algorithm,Mathematics,Combinatorics on words | Journal |
Volume | Issue | ISSN |
41 | 2 | 0988-3754 |
Citations | PageRank | References |
7 | 0.73 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ian Gambini | 1 | 10 | 2.47 |
| Laurent Vuillon | 2 | 186 | 26.63 |