Reconstruction of L-convex Polyominoes

DOI10.1016/S1571-0653(04)00494-9zbMath1173.68761MaRDI QIDQ3438927

Antonio Restivo, Giuseppa Castiglione

Publication date: 29 May 2007

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

Mathematics Subject Classification ID

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

Related Items

Hidden invariance of last passage percolation and directed polymers ⋮ Reconstruction of convex polyominoes with a blocking component ⋮ Combinatorial aspects of \(L\)-convex polyominoes ⋮ ENUMERATION OF n-CONNECTED OMINOES INSCRIBED IN AN ABACUS ⋮ Algebraic properties of the coordinate ring of a convex polyomino ⋮ Regularity and the Gorenstein property of \(L\)-convex polyominoes ⋮ Enumeration of 4-stack polyominoes ⋮ Counting \(k\)-convex polyominoes ⋮ From Tetris to polyominoes generation ⋮ Characterization of hv-convex sequences ⋮ Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses ⋮ Minimum decomposition into convex binary matrices ⋮ Permutation classes and polyomino classes with excluded submatrices ⋮ Recognizable Picture Languages and Polyominoes ⋮ On the tiling system recognizability of various classes of convex polyominoes ⋮ On computing the degree of convexity of polyominoes ⋮ Partially directed animals with a bounded number of holes ⋮ RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES ⋮ On the exhaustive generation of \(k\)-convex polyominoes ⋮ The number of Z-convex polyominoes ⋮ A Dynamical System Approach to Polyominoes Generation* ⋮ On the generation of convex polyominoes ⋮ Increasing and decreasing sequences in fillings of moon polyominoes ⋮ A reconstruction algorithm for L-convex polyominoes. ⋮ The number of directed \(k\)-convex polyominoes ⋮ Enumeration of L-convex polyominoes by rows and columns

Cites Work

• Reconstructing convex polyominoes from horizontal and vertical projections
• Reconstruction of convex 2D discrete sets in polynomial time