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
Reconstructing hv-convex polyominoes from orthogonal projections
Information Processing Letters
Algorithm 445: Binary pattern reconstruction from projections
Communications of the ACM
Reconstruction of 8-connected but not 4-connected hv-convex discrete sets
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
A reconstruction algorithm for L-convex polyominoes
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Higman's Theorem on Discrete Sets
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A decomposition technique for reconstructing discrete sets from four projections
Image and Vision Computing
Reconstruction of binary matrices under fixed size neighborhood constraints
Theoretical Computer Science
On image reconstruction algorithms for binary electromagnetic geotomography
Theoretical Computer Science
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 Binary Images with Few Disjoint Components from Two Projections
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Solving Nonograms by combining relaxations
Pattern Recognition
Reconstruction of 8-connected but not 4-connected hv-convex discrete sets
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Recognizable picture languages and polyominoes
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
A reasoning framework for solving nonograms
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
From linear partitions to parallelogram polyominoes
DLT'11 Proceedings of the 15th international conference on Developments in language theory
The number of line-convex directed polyominoes having the same orthogonal projections
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Ordering and convex polyominoes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Reconstruction of decomposable discrete sets from four projections
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
A tomographical characterization of l-convex polyominoes
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Higman's Theorem on Discrete Sets
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Hi-index | 5.24 |
The reconstruction problem is considered in those classes of discrete sets where the reconstruction can be performed from two projections in polynomial time. The reconstruction algorithms and complexity results are summarized in the case of hv-convex sets, hv-convex 8-connected sets, hv-convex polyominoes, and directed h-convex sets. As new results some properties of the feet and spines of the hv-convex 8-connected sets are proven and it is shown that the spine of such a set can be determined from the projections in linear time. Two algorithms are given to reconstruct hv-convex 8-connected sets. Finally, it is shown that the directed h-convex sets are uniquely reconstructible with respect to their row and column sum vectors.