01426nas a2200169   4500008004100000020002200041245004500063210003700108260004800145300001400193520087500207100002001082700002501102700002301127700002501150856008101175       2008                        eng d  a978-3-540-78274-200aOn the number of hv-convex discrete sets0 anumber of hvconvex discrete sets  aBuffalo, NY, USAbSpringer VerlagcApr 2008  a112 - 1233 a<p>One of the basic problems in discrete tomography is thereconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfills some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruction problem. The class of hv-convex discrete sets and its subclasses have a well-developed theory. Several reconstruction algorithms as well as some complexity results are known for those classes. The key to achieve polynomial-time reconstruction of an hv- convex discrete set is to have the additional assumption that the set is connected as well. This paper collects several statistics on hv-convex discrete sets, which are of great importance in the analysis of algorithms for reconstructing such kind of discrete sets. © 2008 Springer-Verlag Berlin Heidelberg.</p>1 aBalázs, Péter1 aBrimkov, Valentin, E1 aBarneva, Reneta, P1 aHauptman, Herbert, A  uhttps://inf.u-szeged.hu/publication/on-the-number-of-hv-convex-discrete-sets