Tiling with bars under tomographic constraints.

DOI10.1016/S0304-3975(02)00032-4zbMATH Open1046.68113OpenAlexW1974451757MaRDI QIDQ1401161FDOQ1401161

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

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

Recommendations

• scientific article; zbMATH DE number 417272
• Tilings of a torus with rectangular boxes
• Tiling figures of the plane with two bars
• Tiling a simply connected figure with bars of length 2 or 3
• On tiling under tomographic constraints.

zbMATH Keywords

Discrete tomographyDomino tiling

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Cites Work

• Approximating the number of monomer-dimer coverings of a lattice.
• Markov chain algorithms for planar lattice structures
• Title not available (Why is that?)
• Reconstruction of domino tiling from its two orthogonal projections
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

Cited In (10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401161)