An Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rays
We study the problem of reconstructing finite subsets of the integer lattice Z2 from their approximate X-rays in a finite number of prescribed lattice directions. We provide a polynomial-time algorithm for reconstructing Q-convex sets from their “approximate” X-rays. A Qconvex set is a special subset of Z2 having some convexity properties. This algorithm can be used for reconstructing convex subsets of Z2 from their exact X-rays in some sets of four prescribed lattice directions, or in any set of seven prescribed mutually nonparallel lattice directions.
- 3.Y. Boufkhad, O. Dubois and M. Nivat, Reconstructing (h,v)-convex bidimensional patterns of objects from approximate horizontal and vertical projections, preprint. 114, 120Google Scholar
- 4.S. Brunetti, A. Daurat, Reconstruction of Discrete Sets From Two or More Projections in Any Direction, Proc. of the Seventh International Workshop on Combinatorial Image Analysis (IWCIA 2000), Caen, (2000) 241–258. 114, 121Google Scholar
- 6.A. Daurat, Uniqueness of the reconstruction of Q-convex from their projections, preprint. 114, 124Google Scholar
- 10.A. Kuba and G. T. Herman, Discrete Tomography: A Historical Overview, in Discrete Tomography: Foundations, Algorithms and Applications, editors G. T. Herman and A. Kuba, Birkhauser, Boston, MA, USA, (1999) 3–34. 113Google Scholar