A Note on Tiling under Tomographic Constraints

Details A Note on Tiling under Tomographic Constraints A Note on Tiling under Tomographic Constraints

2001-08-21

arxiv.org/abs/cs/0108010v3

Computer Science

Computational Complexity

added one author and a few theorems

Scientific paper

Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling which has given projections. Some simple variants of this problem, involving tiles that are 1x1 or 1x2 rectangles, have been studied in the past, and were proved to be either solvable in polynomial time or NP-complete. In this note we make progress toward a comprehensive classification of various tiling reconstruction problems, by proving NP-completeness results for several sets of tiles.

Affiliated with

Also associated with

No associations

Rating

A Note on Tiling under Tomographic Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Note on Tiling under Tomographic Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Tiling under Tomographic Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-622896