Tiling with bars under tomographic constraints.

DOI10.1016/S0304-3975(02)00032-4zbMath1046.68113OpenAlexW1974451757MaRDI QIDQ1401161

Eric Rémila, Christoph Dürr, Ivan Rapaport, Eric Goles Chacc

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00032-4

zbMATH Keywords

Discrete tomographyDomino tiling

Mathematics Subject Classification ID

Related Items (8)

A heuristic approach to domino grid problem ⋮ On tiling under tomographic constraints. ⋮ A MIP flow model for crop-rotation planning in a context of forest sustainable development ⋮ Reconstruction of binary matrices under fixed size neighborhood constraints ⋮ Tile-packing tomography is \(\mathbb{NP}\)-hard ⋮ Complexity results for the horizontal bar packing problem ⋮ Eric Goles ⋮ The reconstruction of a subclass of domino tilings from two projections

Cites Work

• Unnamed Item
• Approximating the number of monomer-dimer coverings of a lattice.
• Markov Chain Algorithms for Planar Lattice Structures
• Reconstruction of domino tiling from its two orthogonal projections
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

This page was built for publication: Tiling with bars under tomographic constraints.