An Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rays [chapter]

Sara Brunetti, Alain Daurat, Alberto Del Lungo
2000 Lecture Notes in Computer Science  
We study the problem of reconstructing finite subsets of the integer lattice Z 2 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 Z 2 having some convexity properties. This algorithm can be used for reconstructing convex subsets of Z 2 from their exact X-rays in some sets of four prescribed lattice directions, or in any
more » ... t of seven prescribed mutually nonparallel lattice directions.
doi:10.1007/3-540-44438-6_10 fatcat:6cqimlomafg2he6aodnxas6o64