Polyominoes defined by two vectors
A polyomino \(\Lambda\) is a finite union of squares (cells) in the square tiling of the plane such that the interior is connected. A column or row of \(\Lambda\) is the intersection of \(\Lambda\) with an infinite vertical or horizontal strip of squares in the tiling. The problem is to characterize all integral vectors \(A=(a_ 1,\ldots,a_ n)\) and \(B=(b_ 1,\ldots,b_ m)\) such that, within a given class of polyominoes, there is a polyomino \(\Lambda\) with \(n\) columns and \(m\) rows such that \(a_ i\) and \(b_ j\) are the numbers of cells in the \(i\)-th column and \(j\)-th row respectively. The author solves the characterization problem for the following classes of polyominoes: directed column-convex, directed convex, and parallelogram. Also, for each of these classes an algorithm is defined which controls the existence of a polyomino for given vectors \(A\) and \(B\).
- Polyominoes defined by their vertical and horizontal projections
- Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate 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 number of convex polyominoes reconstructible from their orthogonal projections
- 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
- Regular geometrical languages and tiling the plane
- Reconstruction of Discrete Sets from Four Projections: Strong Decomposability
- Polyominoes with nearly convex columns: a model with semidirected blocks
- Reconstructing convex matrices by integer programming approaches
- Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections
- scientific article; zbMATH DE number 4195980 (Why is no real title available?)
- DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION
- Reconstruction of domino tiling from its two orthogonal projections
- X-rays characterizing some classes of discrete sets
- Reconstructing convex polyominoes from horizontal and vertical projections
- Discrete tomography problems with paired projections and complexity characteristics
- A polyomino with no stochastic function
- A benchmark set for the reconstruction of \(hv\)-convex discrete sets
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)
