6533b854fe1ef96bd12af681

RESEARCH PRODUCT

An Efficient Algorithm for the Generation of Z-Convex Polyominoes

Paolo MassazzaGiusi Castiglione

subject

Discrete mathematicsAmortized analysisMathematics::CombinatoricsSettore INF/01 - InformaticaPolyominoEfficient algorithmRegular polygonComputer Science::Computational GeometryCharacterization (mathematics)CombinatoricsIntegerComputer Science::Discrete MathematicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYConstant (mathematics)TetrominoZ-convex polyominoes generation.Mathematics

description

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.

yearjournalcountryeditionlanguage
2014-01-01
http://hdl.handle.net/11383/1859918