Polyominoes defined by two vectors

DOI10.1016/0304-3975(94)90107-4MaRDI QIDQ1325843zbMATH OpenOpenAlexFDO

Authors A. Del Lungo

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

zbMATH Keywords

characterizationparallelogrampolyominocellsintegral vectorssquare tiling

Mathematics Subject Classification ID

Polyominoes (05B50)

Recommendations

• Polyominoes defined by their vertical and horizontal projections
• Polyominoes with nearly convex columns: a model with semidirected blocks
• Polyominoes determined by permutations
• On the generation of 2-polyominoes
• scientific article; zbMATH DE number 1943101

Cites work

• scientific article; zbMATH DE number 3968590 (Why is no real title available?)
• scientific article; zbMATH DE number 17705 (Why is no real title available?)
• The undecidability of the domino problem
• Tiling with sets of polyominoes

Cited in

(20)

• Reconstruction of Discrete Sets from Four Projections: Strong Decomposability
• X-rays characterizing some classes of discrete sets
• A benchmark set for the reconstruction of \(hv\)-convex discrete sets
• Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections.
• Reconstructing convex polyominoes from horizontal and vertical projections
• The reconstruction of polyominoes from their orthogonal projections
• Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets
• Algorithms for polyominoes based on the discrete Green theorem
• The discrete Green theorem and some applications in discrete geometry
• The number of convex polyominoes reconstructible from their orthogonal projections
• Reconstruction of convex polyominoes from orthogonal projections of their contours
• Reconstruction of domino tiling from its two orthogonal projections
• Polyominoes with nearly convex columns: a model with semidirected blocks
• A polyomino with no stochastic function
• Regular geometrical languages and tiling the plane
• Polyominoes defined by their vertical and horizontal projections
• Reconstructing convex matrices by integer programming approaches
• Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections
• In memoriam: Alberto Del Lungo (1965--2003)
• DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION

This page was built for publication: Polyominoes defined by two vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325843)