A reconstruction algorithm for L-convex polyominoes.

DOI10.1016/j.tcs.2006.01.045zbMath1160.68609OpenAlexW2079617181MaRDI QIDQ2490808

Antonio Restivo, Roberto Vaglica, Giuseppa Castiglione

Publication date: 18 May 2006

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

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

zbMATH Keywords

convexityreconstructionpolyominoes

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Smooth column convex polyominoes ⋮ Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses ⋮ Discrete tomography for inscribable lattice sets ⋮ On computing the degree of convexity of polyominoes ⋮ RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES

Cites Work

• Reconstructing convex polyominoes from horizontal and vertical projections
• Reconstruction of convex 2D discrete sets in polynomial time
• The number of convex polyominoes reconstructible from their orthogonal projections
• Combinatorial aspects of \(L\)-convex polyominoes
• Enumeration of L-convex polyominoes by rows and columns
• Reconstruction of L-convex Polyominoes
• Discrete Geometry for Computer Imagery
• Machines, Computations, and Universality
• Checker Boards and Polyominoes

This page was built for publication: A reconstruction algorithm for L-convex polyominoes.