The reconstruction of discrete two- or three-dimensional sets from their orthogonal projections is one of the central problems
in the areas of medical diagnostics, computer-aided tomography, and pattern recognition. In this paper we will give a polynomial
algorithm for reconstruction of some class of convex three-dimensional polyominoes that has time complexity O(n
7
log n).
Supported by the KBN grant No. 7 T11C 03220.