Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
Reconstructing hv-convex polyominoes from orthogonal projections
Information Processing Letters
The reconstruction of polyominoes from their orthogonal projections
Information Processing Letters
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
Theoretical Computer Science
Discrete Tomography: Reconstruction under Periodicity Constraints
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Reconstruction of binary matrices under fixed size neighborhood constraints
Theoretical Computer Science
Hi-index | 0.00 |
This paper deals with the reconstruction of an alternate periodical binary matrix from its orthogonal projections. For a fixed vector (p,q), a binary matrix A is alternate periodical when A$_{i,{\it j}}$+A$_{i+{\it p},{\it j}+{\it q}}$=1. For vectors (p = 1,q = 1),(p,0) and (0,q) we propose polynomial time algorithms to reconstruct an alternate periodical binary matrix from both its vertical and horizontal projections if such a matrix exists.