Generating convex polyominoes at random

DOI10.1016/0012-365X(95)00134-IzbMath0854.05032MaRDI QIDQ1917521

Winfried Hochstättler, Christoph Moll, Martin Loebl

Publication date: 3 September 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomial time algorithmprobabilistic algorithmpolyominoconvex polyominoes

Mathematics Subject Classification ID

Polyominoes (05B50)

Related Items (16)

Using pattern matching for tiling and packing problems ⋮ Saturated fully leafed tree-like polyforms and polycubes ⋮ Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees ⋮ Binary image reconstruction from a small number of projections and the morphological skeleton ⋮ A framework for generating some discrete sets with disjoint components by using uniform distributions ⋮ A benchmark set for the reconstruction of \(hv\)-convex discrete sets ⋮ Stability in discrete tomography: some positive results ⋮ X-rays characterizing some classes of discrete sets ⋮ Comparison of algorithms for reconstructing \(hv\)-convex discrete sets ⋮ Reconstruction of 4- and 8-connected convex discrete sets from row and column projections ⋮ An evolutionary algorithm for discrete tomography ⋮ Optimization and reconstruction of \(hv\)-convex (0,1)-matrices ⋮ Random generation of \(Q\)-convex sets ⋮ Optimization and reconstruction of hv-convex (0,1)-matrices ⋮ An experimental study of the stability problem in discrete tomography ⋮ Detection of the discrete convexity of polyominoes

Cites Work

• Unnamed Item
• Polyominoes which tile rectangles
• The number of convex polyominoes with given perimeter
• Combinatorial properties of polyominoes
• Algebraic languages and polyominoes enumeration
• Tiling with polyominoes and combinatorial group theory
• Convex n-ominoes
• On the number of certain lattice polygons

This page was built for publication: Generating convex polyominoes at random