Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
The number of convex polyominoes reconstructible from their orthogonal projections
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Decision Trees in Binary Tomography for Supporting the Reconstruction of hv-Convex Connected Images
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Reconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Reconstruction of decomposable discrete sets from four projections
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
The problem of reconstruction of two-dimensional discrete sets from their two projections is considered in different classes. The reconstruction algorithms and complexity results are summarized in the case of hv-convex sets, hv-convex polyominoes, hv-convex 8-connected sets, and directed h-convex sets. We show that the reconstruction algorithms used in the class of hv-convex 4-connected sets (polyominoes) can be used, with small modifications, for reconstructing hv-convex 8- connected sets. Finally, it is shown that the directed h-convex sets are uniquely reconstructible with respect to the row and column sum vectors.