On tiling under tomographic constraints.

DOI10.1016/S0304-3975(02)00542-XzbMath1044.68151OpenAlexW2060448518MaRDI QIDQ1401222

Marek Chrobak, Gerhard J. Woeginger, Peter Couperus, Christoph Dürr

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)00542-x

zbMATH Keywords

Discrete tomographyTiling

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items (7)

Reconstruction of convex polyominoes with a blocking component ⋮ Approximating Bicolored Images from Discrete Projections ⋮ Reconstruction of binary matrices under fixed size neighborhood constraints ⋮ Tile-packing tomography is \(\mathbb{NP}\)-hard ⋮ The reconstruction of a subclass of domino tilings from two projections ⋮ Reconstruction of low degree domino tilings ⋮ Reconstruction of binary matrices under adjacency constraints

Cites Work

• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Tiling with bars under tomographic constraints.
• On the computational complexity of determining polyatomic structures by X-rays
• Combinatorial Properties of Matrices of Zeros and Ones
• 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: On tiling under tomographic constraints.