On the exhaustive generation of k-convex polyominoes

DOI10.1016/J.TCS.2016.02.006MaRDI QIDQ517034zbMATH OpenOpenAlexFDO

Authors Stefano Brocchi, G. Castiglione, P. 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

CAT algorithmsexhaustive generationconvex polyominoes

Mathematics Subject Classification ID

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

Recommendations

• On the generation of convex polyominoes
• On the generation and enumeration of some classes of convex polyominoes
• On the exhaustive generation of convex permutominoes
• scientific article; zbMATH DE number 2040945
• Generating convex polyominoes at random
• Counting k-convex polyominoes
• An efficient algorithm for the generation of Z-convex polyominoes
• On the generation of 2-polyominoes
• On computing the degree of convexity of polyominoes
• The number of convex polyominoes and the generating function of Jacobi polynomials

Cites work

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

Cited in

(14)

• On the generation of convex polyominoes
• Encoding centered polyominoes by means of a regular language
• The number of \(k\)-parallelogram polyominoes
• An efficient algorithm for the generation of Z-convex polyominoes
• Partially directed animals with a bounded number of holes
• The number of directed \(k\)-convex polyominoes
• The generating function of convex polyominoes: The resolution of a \(q\)- differential system
• Random generation of \(hv\)-convex polyominoes with given horizontal projection
• scientific article; zbMATH DE number 5548206 (Why is no real title available?)
• On computing the degree of convexity of polyominoes
• From Tetris to polyominoes generation
• Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
• A Dynamical System Approach to Polyominoes Generation*
• scientific article; zbMATH DE number 2040945 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517034)