| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418621 | Discrete Applied Mathematics | 2015 | 12 Pages |
Abstract
A convex polyomino can be easily represented by a pair of suitable integer vectors. This lets us design a CAT (Constant Amortized Time) algorithm for generating all convex polyominoes of size nn using O(n)O(n) space.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Paolo Massazza,