Reconstruction of domino tiling from its two orthogonal projections

Theoretical Computer Science

Volumn 255, Issue 1-2, 2001, Pages 437-447

  Picouleau, C ^a  

^a CEDRIC CNAM   (France)

Author keywords

Domino tiling; NP completeness; Polynomial time algorithm; Reconstruction problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; THEOREM PROVING;

DOMINO TILING;

COMPUTATIONAL GEOMETRY;

EID: 0034922618     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00312-6     Document Type: Article

References (11)

1. Reconstructing convex polyominoes from horizonal and vertical projections
2. Polyominoes defined by two vectors
3. The number of convex polyominoes reconstructable from their orthogonal projections
4. Discrete tomography: Determination of finite sets by X-rays
5. On the computational complexity of determining polyatomic structures by x-Rays