On the exhaustive generation of \(k\)-convex polyominoes

DOI10.1016/j.tcs.2016.02.006zbMath1358.05050OpenAlexW2272170100MaRDI QIDQ517034

Giuseppa Castiglione, Stefano Brocchi, Paolo Massazza

Publication date: 16 March 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.006

zbMATH Keywords

convex polyominoesCAT algorithmsexhaustive generation

Mathematics Subject Classification ID

Polytopes and polyhedra (52B99) Polyominoes (05B50)

Related Items (5)

From Tetris to polyominoes generation ⋮ Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses ⋮ Partially directed animals with a bounded number of holes ⋮ A Dynamical System Approach to Polyominoes Generation* ⋮ The number of directed \(k\)-convex polyominoes

Cites Work

• Unnamed Item
• Counting \(k\)-convex polyominoes
• On computing the degree of convexity of polyominoes
• Algebraic languages and polyominoes enumeration
• On the generation and enumeration of some classes of convex polyominoes
• A method for the enumeration of various classes of column-convex polygons
• A tiling system for the class of \(L\)-convex polyominoes
• On the generation of convex polyominoes
• Combinatorial aspects of \(L\)-convex polyominoes
• The number of Z-convex polyominoes
• The number of directed k-convex polyominoes
• Reconstruction of L-convex Polyominoes
• An Efficient Algorithm for the Generation of Z-Convex Polyominoes
• Discrete Geometry for Computer Imagery
• Checker Boards and Polyominoes

This page was built for publication: On the exhaustive generation of \(k\)-convex polyominoes