On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional X-rays Original Research Article

A generalization of a classical discrete tomography problem is considered: reconstruct three-dimensional lattice sets from their two-dimensional X-rays parallel to three coordinate planes. First, we prove that this reconstruction problem is NP-hard. Then we propose some greedy algorithms that provide approximate solutions of the problem.