On tiling under tomographic constraints.

DOI10.1016/S0304-3975(02)00542-XMaRDI QIDQ1401222zbMATH OpenOpenAlexFDO

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

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, https://research.utwente.nl/en/publications/c61c6144-eef5-4e16-8bb5-500e28757428

zbMATH Keywords

Discrete tomographyTiling

Mathematics Subject Classification ID

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

Recommendations

• Tiling with bars under tomographic constraints.
• Dense Projection Tomography on the Triangular Tiling
• Tile-packing tomography is \({\mathbb{NP}}\)-hard
• Tile-packing tomography is \(\mathbb{NP}\)-hard
• The Tiling Problem Revisited (Extended Abstract)
• Tomographical aspects of L-convex polyominoes
• Boundary parametrization and the topology of tiles
• Tomography of convex bodies and inscribed polygons
• The NP-completeness of a tomographical problem on bicolored domino tilings
• Discrete tomography and plane partitions

Cites work

• Combinatorial Properties of Matrices of Zeros and Ones
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• On the computational complexity of determining polyatomic structures by X-rays
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
• Reconstruction of domino tiling from its two orthogonal projections
• Tiling with bars under tomographic constraints.

Cited in

(13)

• Tiling with bars under tomographic constraints.
• Tile-packing tomography is \(\mathbb{NP}\)-hard
• The reconstruction of a subclass of domino tilings from two projections
• Reconstruction of convex polyominoes with a blocking component
• Approximating Bicolored Images from Discrete Projections
• Reconstruction of low degree domino tilings
• Reconstruction of binary matrices under adjacency constraints
• Tile-packing tomography is \({\mathbb{NP}}\)-hard
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
• Dense Projection Tomography on the Triangular Tiling
• Reconstruction of domino tiling from its two orthogonal projections
• The NP-completeness of a tomographical problem on bicolored domino tilings
• Reconstruction of binary matrices under fixed size neighborhood constraints

This page was built for publication: On tiling under tomographic constraints.

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