RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES

DOI10.1142/S1793830910000437zbMath1189.05047MaRDI QIDQ3560057

Khalil Tawbe

Publication date: 19 May 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

discrete geometrydiscrete tomography\(HV\)-convex polyominoes

Mathematics Subject Classification ID

Polyominoes (05B50)

Cites Work

• Reconstructing convex polyominoes from horizontal and vertical projections
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Algebraic languages and polyominoes enumeration
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Combinatorial aspects of \(L\)-convex polyominoes
• The number of Z-convex polyominoes
• A reconstruction algorithm for L-convex polyominoes.
• Random generation of \(Q\)-convex sets
• Reconstruction of L-convex Polyominoes
• On the Complexity of Timetable and Multicommodity Flow Problems

This page was built for publication: RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES