On the generation of convex polyominoes
From MaRDI portal
Publication:2255820
DOI10.1016/j.dam.2014.02.014zbMath1307.05046OpenAlexW1986394254MaRDI QIDQ2255820
Publication date: 18 February 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.02.014
Related Items (6)
From Tetris to polyominoes generation ⋮ On computing the degree of convexity of polyominoes ⋮ Partially directed animals with a bounded number of holes ⋮ On the exhaustive generation of \(k\)-convex polyominoes ⋮ A Dynamical System Approach to Polyominoes Generation* ⋮ On the generation of convex polyominoes
Cites Work
- Unnamed Item
- Unnamed Item
- On the tiling system recognizability of various classes of convex polyominoes
- Reconstructing convex polyominoes from horizontal and vertical projections
- Gray codes for column-convex polyominoes and a new class of distributive lattices
- Algebraic languages and polyominoes enumeration
- Reconstruction of convex 2D discrete sets in polynomial time
- On the generation and enumeration of some classes of convex polyominoes
- A method for the enumeration of various classes of column-convex polygons
- On the generation of convex polyominoes
- The number of Z-convex polyominoes
- Reconstruction of L-convex Polyominoes
- Recognizable Picture Languages and Polyominoes
- Tiling the Plane with a Fixed Number of Polyominoes
- From Linear Partitions to Parallelogram Polyominoes
- Checker Boards and Polyominoes
This page was built for publication: On the generation of convex polyominoes
