Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
The reconstruction of binary patterns from their projections
Communications of the ACM
Characterization of Binary Patterns and Their Projections
IEEE Transactions on Computers
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 Some 3D Convex Polyominoes from Orthogonal Projections
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Fast filling operations used in the reconstruction of convex lattice sets
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
The problem of reconstructing a discrete set from its horizontal and vertical projections (RSP) is of primary importance in many different problems for example pattern recognition, image processing and data compression. We give a new algorithm which provides a reconstruction of convex polyominoes from horizontal and vertical projections. It costs atmost O(min(m, n)2 ċ mn log mn) for a matrix that has m × n cells. In this paper we provide just a sketch of the algorithm.