On the generation of convex polyominoes

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.