00935nas a2200109   4500008004100000245007100041210006900112260008100181300001400262520050800276856004100784       2005                        eng d00aReconstruction of decomposable discrete sets from four projections0 aReconstruction of decomposable discrete sets from four projectio  aBerlin; Heidelberg; New York; London; Paris; TokyobSpringer Verlagc2005///  a104 - 1143 a<p>In this paper we introduce the class of decomposable discretesets and give a polynomial algorithm for reconstructing discrete sets of this class from four projections. It is also shown that the class of decomposable discrete sets is more general than the class S′8 of hv-convex 8-but not 4-connected discrete sets which was studied in [3]. As a consequence we also get that the reconstruction from four projections in S′8can be solved in O(mn) time. © Springer-Verlag Berlin Heidelberg 2005.</p>  uhttps://inf.u-szeged.hu/en/node/1141