On the exhaustive generation of k-convex polyominoes
From MaRDI portal
(Redirected from On the exhaustive generation of k-convex polyominoes)
On the exhaustive generation of \(k\)-convex polyominoes
On the exhaustive generation of \(k\)-convex polyominoes
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 \(k\)-parallelogram polyominoes
- The number of directed \(k\)-convex polyominoes
- The number of Z-convex polyominoes
Cited in
(17)- The generating function of convex polyominoes: The resolution of a \(q\)- differential system
- From Tetris to polyominoes generation
- Generating convex polyominoes at random
- Partially directed animals with a bounded number of holes
- On the generation of convex polyominoes
- The number of directed \(k\)-convex polyominoes
- Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
- scientific article; zbMATH DE number 5548206 (Why is no real title available?)
- scientific article; zbMATH DE number 2040945 (Why is no real title available?)
- On computing the degree of convexity of polyominoes
- A Dynamical System Approach to Polyominoes Generation*
- Encoding centered polyominoes by means of a regular language
- An efficient algorithm for the generation of Z-convex polyominoes
- Random generation of \(hv\)-convex polyominoes with given horizontal projection
- The number of \(k\)-parallelogram polyominoes
- Efficient counting of k-convex polyominoes
- Centered ascending polyominoes
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)
