Reconstructing hv-convex polyominoes from orthogonal projections
Information Processing Letters
Reconstruction of Discrete Sets with Absorption
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Theoretical Computer Science
An algorithm for the reconstruction of discrete sets from two projections in presence of absorption
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
A sufficient condition for non-uniqueness in binary tomography with absorption
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
An algorithm for the reconstruction of discrete sets from two projections in presence of absorption
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Construction of switching components
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Two remarks on reconstructing binary vectors from their absorbed projections
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
A generalization of the classical discrete tomography problem is considered: Reconstruct binary matrices from their absorbed row and column sums. We show that this reconstruction problem can be linked to a 3SAT problem if the absorption is characterized with the constant 脽 = ln((1 + 驴5)/2).