The Reconstruction of a Bicolored Domino Tiling from Two Projections

Authors:
Andrea Frosini;G. Simi
Affiliations:
-;-
Venue:
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Year:
2002

Citing 4
Cited 0

Reconstruction of domino tiling from its two orthogonal projections

Theoretical Computer Science
The reconstruction of polyominoes from their orthogonal projections

Information Processing Letters
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

We challenge the problem of the reconstruction of a bicolored domino tiling of a rectangle from its horizontal and vertical projections. We give two NP-completeness results after having defined two non equivalent and very natural notions of projections on a generic bicolored domino tiling. The more general problem of the reconstruction of monochromatic domino tilings is still left open.