An Efficient Algorithm for the Generation of Z-Convex Polyominoes

Abstract

We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors. This lets us design an algorithm which generates all Z-convex polyominoes of size n in constant amortized time.