The Reconstruction of Some 3d Convex Polyominoes from Orthogonal Projections^*

Abstract

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⁷log n).

Published in Proceedings of 29th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM), Milovy, Czech Republic, November 24-29, 2002, Lecture Notes in Computer Science, vol. 2540, Springer-Verlag 2002, pp. 262-272.

^*Supported by the KBN grant No. 7 T11C 03220

Conference paper

Conference presentation.