Reconstruction of discrete sets from two or more X-rays in any direction

Sara Brunetti (1) , Alain Daurat (2)

1 DSI - Dipartimento di Sistemi e Informatica
2 LLAIC1 - Laboratoire de Logique, Algorithmique et Informatique

During the workshop entitled "Discrete Tomography", held in Volkrange on March 22, 1999, A. Kuba presented the open problem of reconstructing discrete sets satisfying the properties of connectivity and convexity by projections taken along many directions. In this paper, we study this problem, considering a similar property of discrete sets: the Q-convexity. In fact this property contains a certain kind of connectivity and convexity. The main result of this paper is a polynomial-time algorithm which is able to reconstruct Q-convex sets from their projections, when the directions of the projections and the ones of the Q-convexity are the same. Moreover, the algorithm works for any finite number of directions.

Mots clés: algorithms; combinatorial problems; convexity; discrete tomography; discrete sets

Domaines: Mathématique discrète [cs.DM]

Sara Brunetti, Alain Daurat. Reconstruction of discrete sets from two or more X-rays in any direction. 2000, pp.241-258. ⟨hal-00023032⟩