Reconstruction of discrete sets from three or more X-rays

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1767, Issue , 2000, Pages 199-210

  Barcucci, Elena ^a   Brunetti, Sara ^a   Del Lungo, Alberto ^b   Nivat, Maurice ^c  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF SIENA   (Italy)

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

algorithms; combinatorial problems; discrete sets; discrete tomography; X rays

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION;

COMBINATORIAL PROBLEM; CONVEXITY PROPERTIES; DISCRETE SETS; DISCRETE TOMOGRAPHY; FINITE NUMBER; NP COMPLETE; POLYNOMIAL-TIME ALGORITHMS;

X RAYS;

EID: 22844456020     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46521-9_17     Document Type: Article

References (18)

1. R. P. Anstee, "Invariant sets of arcs in network flow problems," Disc. Appl. Math. 13, 1-7 (1986).
2. B. Aspvall, M.F. Plass and R.E. Tarjan," A linear-time algorithm for testing the truth of certain quantified Boolean formulas", Inf. Proc. Lett., 8, 3 (1979).
3. E. Barcucci, A. Del Lungo, M. Nivat and R. Pinzani," Reconstructing convex polyominoes from their horizontal and vertical projections", Theor. Comp. Sci., 155 (1996) 321-347.
4. M. Chrobak, C. Dürr, "Reconstructing hv-Convex Polyominoes from Orthogonal Projections", Inf. Proc. Lett. (69) 6, (1999) 283-289.
5. th FPSAC, Vienna, 222-235 (1997).
6. R. J. Gardner, Geometric Tomography, Cambridge University Press, Cambridge, UK, 1995, p.51.
7. R. J. Gardner and P. Gritzmann, "Uniqueness and Complexity in Discrete Tomography", in discrete tomography: foundations, algorithms and applications, editors G.T. Herman and A. Kuba, Birkhauser, Boston, MA, USA, (1999) 85-111.
8. R. J. Gardner, P. Gritzmann and D. Prangenberg, "On the computational complexity of reconstructing lattice sets from their X-rays," Disc. Math. 202, (1999) 45-71.
9. M. R. Garey and D.S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, Freeman, New York, (1979) 224.
10. P. Gritzmann, "Open problems," in Discrete Tomography: Algorithms and Complexity, Dagstuhl Seminar report 165 (1997) 18.
11. P. C. Hammer, "Problem 2," in Proc. Simp. Pure Math. vol VII: Convexity, Amer. Math. Soc., Providence, RI, (1963) 498-499.
12. G.T. Herman and A. Kuba, "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-29.
13. M. Gebala :The reconstruction of convex polyominoes from horizontal and vertical projections, private comunication.
14. R. W. Irving and M. R. Jerrum, "Three-dimensional statistical data security problems," SIAM Journal of Computing 23, 170-184 (1994).
15. C. Kisielowski, P. Schwander, F. H. Baumann, M. Seibt, Y. Kim and A. Ourmazd, "An approach to quantitative high-resolution transmission electron microscopy of crystalline materials," Ultramicroscopy 58, 131-155 (1995).
16. G. P. M. Prause and D. G. W. Onnasch, "Binary reconstruction of the heart chambers from biplane angiographic image sequence," IEEE Trans. Medical Imaging 15, 532-559 (1996).
17. A. R. Shliferstein and Y. T. Chien, "Switching components and the ambiguity problem in the reconstruction of pictures from their projections," Pattern Recognition 10, 327-340 (1978).
18. X. G. Viennot, A Survey of polyomino enumeration, Proc. Series formelles et combinatoire algébrique, eds. P. Leroux et C. Reutenauer, Publications du LACIM 11, Université du Québec a Montreal (1992).