On the Generation of 2-Polyominoes
Abstract
The class of 2-polyominoes contains all polyominoes P such that for any integer i, the first i columns of P consist of at most 2 polyominoes. We provide a decomposition that allows us to exploit suitable discrete dynamical systems to define an algorithm for generating all 2-polyominoes of area n in constant amortized time and space O(n).
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|
Loading...
