Polyominoes defined by two vectors
From MaRDI portal
Publication:1325843
DOI10.1016/0304-3975(94)90107-4zbMath0797.05031OpenAlexW2159400964MaRDI QIDQ1325843
Publication date: 22 June 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90107-4
Related Items
Polyominoes defined by their vertical and horizontal projections ⋮ DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION ⋮ The number of convex polyominoes reconstructible from their orthogonal projections ⋮ Reconstructing convex matrices by integer programming approaches ⋮ Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections ⋮ Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections. ⋮ Reconstructing convex polyominoes from horizontal and vertical projections ⋮ A benchmark set for the reconstruction of \(hv\)-convex discrete sets ⋮ Reconstruction of domino tiling from its two orthogonal projections ⋮ Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets ⋮ Algorithms for polyominoes based on the discrete Green theorem ⋮ X-rays characterizing some classes of discrete sets ⋮ Regular Geometrical Languages and Tiling the Plane ⋮ In memoriam: Alberto Del Lungo (1965--2003) ⋮ The discrete Green theorem and some applications in discrete geometry ⋮ Reconstruction of convex polyominoes from orthogonal projections of their contours ⋮ Reconstruction of Discrete Sets from Four Projections: Strong Decomposability ⋮ The reconstruction of polyominoes from their orthogonal projections
Cites Work
