An Efficient Algorithm for the Generation of Z-Convex Polyominoes

DOI10.1007/978-3-319-07148-0_6zbMath1486.68247OpenAlexW1671437MaRDI QIDQ5246052

Paolo Massazza, Giuseppa Castiglione

Publication date: 17 April 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07148-0_6

zbMATH Keywords

complexitytilingpolyominoconvex polyominoZ-convex polyomino

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Polyominoes (05B50)

Related Items (4)

From Tetris to polyominoes generation ⋮ Partially directed animals with a bounded number of holes ⋮ On the exhaustive generation of \(k\)-convex polyominoes ⋮ A Dynamical System Approach to Polyominoes Generation*

This page was built for publication: An Efficient Algorithm for the Generation of Z-Convex Polyominoes