Invariant sets of arcs in network flow problems
Discrete Applied Mathematics
Three-Dimensional Statistical Data Security Problems
SIAM Journal on Computing
Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
Reconstructing hv-convex polyominoes from orthogonal projections
Information Processing Letters
On the computational complexity of reconstructing lattice sets from their x-rays
Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Discrete Q-convex sets reconstruction from discrete point X-rays
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
| Hi-index | 0.00 |
The problem of reconstructing a discrete set from its X-rays in a finite number of prescribed directions is NP-complete when the number of prescribed directions is greater than two. In this paper, we consider an interesting subclass of discrete sets having some connectivity and convexity properties and we provide a polynomial-time algorithm for reconstructing a discrete set of this class from its X-rays in directions (1, 0), (0, 1) and (1, 1). This algorithm can be easily extended to contexts having more than three X-rays.