01303nas a2200157   4500008004100000020002200041245009700063210006900160260008200229300001400311520062200325100002000947700002200967700002300989856013301012       2009                        eng d  a978-3-642-10208-000aReconstruction of canonical hv-convex discrete sets from horizontal and vertical projections0 aReconstruction of canonical hvconvex discrete sets from horizont  aBerlin; Heidelberg; New York; London; Paris; TokyobSpringer VerlagcNov 2009  a280 - 2883 a<p>The problem of reconstructing some special hv-convex discretesets from their two orthogonal projections is considered. In general, the problem is known to be NP-hard, but it is solvable in polynomial time if the discrete set to be reconstructed is also 8-connected. In this paper, we define an intermediate class - the class of hv-convex canonical discrete sets - and give a constructive proof that the above problem remains computationally tractable for this class, too. We also discuss some further theoretical consequences and present experimental results as well. © Springer-Verlag Berlin Heidelberg 2009.</p>1 aBalázs, Péter1 aWiederhold, Petra1 aBarneva, Reneta, P  uhttps://inf.u-szeged.hu/publication/reconstruction-of-canonical-hv-convex-discrete-sets-from-horizontal-and-vertical-projections