A tiling system for the class of \(L\)-convex polyominoes

DOI10.1016/j.tcs.2012.12.033zbMath1259.05036OpenAlexW2040696991MaRDI QIDQ1939281

Renzo Pinzani, Andrea Frosini, Stefano Brocchi, Simone Rinaldi

Publication date: 4 March 2013

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

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

zbMATH Keywords

tiling\(L\)-convexity constraint

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Related Items (4)

Reconstruction of convex polyominoes with a blocking component ⋮ Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses ⋮ On computing the degree of convexity of polyominoes ⋮ On the exhaustive generation of \(k\)-convex polyominoes

This page was built for publication: A tiling system for the class of \(L\)-convex polyominoes