Tiling with bars under tomographic constraints

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 1317-1329

  Dürr, Christoph ^a   Goles, Eric ^b   Rapaport, Ivan ^b   Rémila, Eric ^c,d  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITY OF CHILE   (Chile)

^c IUT de Roanne   (France)

^d UNIV LYON   (France)

Author keywords

Discrete tomography; Domino tiling

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE;

DISCRETE TOMOGRAPHY; DOMINO TILINGS; HORIZONTAL BARS; INITIAL PROBLEM; NOCV1; TOMOGRAPHIC;

TOMOGRAPHY;

EID: 85009216288     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00032-4     Document Type: Article

References (6)

1. [1] Chrobak, M., Dürr, C., Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms. Theor. Comput. Sci. 259 (2001), 81–98.
2. [2] Kenyon, C., Randall, D., Sinclair, A., Approximating the number of monomer-dimer coverings of a lattice. J. Stat. Phys. 83 (1996), 637–659.
3. [3] Kisielowski, C., Schwander, P., Baumann, F.H., Seibt, M., Kim, Y., Ourmazd, A., An approach to quantitate high-resolution transmission electron microscopy of crystalline materials. Ultramicroscopy 58 (1995), 131–155.
4. [4] Luby, M., Randall, D., Sinclair, A., Markov Chain algorithms for planar lattice structures. SIAM J. Comput. 31 (2001), 167–192.
5. [5] Picouleau, C., Reconstruction of domino tiling from its two orthogonal projections. Theor. Comput. Sci. 255 (2001), 437–447.
6. [6] Ryser, H.J., Combinatorial Mathematics, Mathematical Association of America and Quinn & Boden, 1963, Rahway, New Jersey.