The reconstruction of two-directionally connected binary patterns from their two orthogonal projections

Abstract A heuristic reconstruction algorithm is described, by which binary matrices can be produced from their two orthogonal projections. It is necessary for proper reconstruction that the binary pattern corresponding to the binary matrix bex- andy-directionally connected. By this method a large class of binary matrices can be reconstructed. It is proved that after a finite number of iterative steps this algorithm produces all thex- andy-directionally connected binary patterns belonging to the given two projections. Finally, some remarks on the implementation of this algorithm and results are presented.