A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 anydoi:10.1007/3-540-44438-6_10 fatcat:6cqimlomafg2he6aodnxas6o64