Reconstruction of polyominoes from their orthogonal projections

Information Processing Letters

Volumn 77, Issue 5-6, 2001, Pages 225-229

  Woeginger, Gerhard J ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; IMAGE ANALYSIS; PROBLEM SOLVING;

POLYOMINOES;

IMAGE RECONSTRUCTION;

EID: 0035277488     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00162-9     Document Type: Article

References (9)

1. Barcucci E., Del Lungo A., Nivat M., Pinzani R. Reconstructing convex polyominoes from horizontal and vertical projections. Theoret. Comput. Sci. 155:1996;321-347.
2. Chang S.K. The reconstruction of binary patterns from their projections. Comm. ACM. 14:1971;21-25.
3. Chang S.K., Chow C.K. The reconstruction of three-dimensional objects from two orthogonal projections and its application to cardiac cineangiography. IEEE Trans. Systems Man. Cybernet. 1:1971;90-94.
4. Chrobak M., Dürr C. Reconstructing hv-convex polyominoes from orthogonal projections. Inform. Process. Lett. 69:1999;283-289.
5. Del Lungo A. Polyominoes defined by two vectors. Theoret. Comput. Sci. 127:1994;187-198.
6. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA.
7. Golomb S.W. Polyominoes. 1965;Scribner, New York.
8. Kuba A. The reconstruction of two-directionally connected binary patterns from their two projections. Comput. Vision Graph. Image Processing. 27:1984;249-265.
9. Ryser H. Combinatorial Mathematics. The Carus Mathematical Monographs. 14:1963;Mathematical Association of America, Rahway.