On the Generation of L-Convex Polyominoes
Paolo Massazza · IrInSubria (University of Insubria) · 2012
We present a simple but efficient method for generating the set LPol(n) of L-convex polyominoes of size n.We show a bijection between LPol(n) and a suitable set of pairs of integer sequences.This lets us design a CAT (Constant Amortized Time) algorithm for generating LPol(n) using O( √ n) space.