Three-Dimensional Statistical Data Security Problems
SIAM Journal on Computing
Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
Reconstructing hv-convex polyominoes from orthogonal projections
Information Processing Letters
On the computational complexity of reconstructing lattice sets from their x-rays
Discrete Mathematics
The reconstruction of binary patterns from their projections
Communications of the ACM
The reconstruction of polyominoes from their orthogonal projections
Information Processing Letters
The Reconstruction of Polyominoes from Approximately Orthogonal Projections
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
The Reconstruction of Convex Polyominoes from Horizontal and Vertical Projections
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Characterization of Binary Patterns and Their Projections
IEEE Transactions on Computers
| Hi-index | 0.01 |
The reconstruction of discrete two- or three-dimensional sets from their orthogonal projections is one of the central problems in the areas of medical diagnostics, computer-aided tomography, and pattern recognition. In this paper we will give a polynomial algorithm for reconstruction of some class of convex three-dimensional polyominoes that has time complexity O(n7 log n).