The reconstruction of 8-connected but not 4-connected -convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity of and in this case the solution is uniquely determined. Finally, we consider the possible generalizations of our results to solve the problem in more general classes.
It has already been shown that the choice of projection angles can significantly influence the quality of reconstructions in discrete tomography. In this contribution we summarize and extend the previous results by explaining and demonstrating the effects of projection selection dependency, in a set of experimental software tests. We perform reconstructions of software phantoms, by using different binary tomography reconstruction algorithms, from different equiangular and non-equiangular projections sets, under various conditions (i.e., when the objects to be reconstructed undergo slight topological changes, or the projection data is affected by noise) and compare the results with suitable approaches. Based on our observations, we reveal regularities in the resulting data and discuss possible consequences of such projection selection dependency in binary tomography.