A Note on Tiling under Tomographic Constraints
Marek Chrobak, Peter Couperus, Christoph Durr, Gerhard Woeginger
Abstract
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 theprojections. 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.
Create a lesson
Related papers
How far is Kolmogorov-Loveland randomness from Martin-Löf randomness?
Tomislav Petrović
The Complexity of Finding Additional Solutions
Saman Farhat
On the Hardness of 4-to-1 Games with Perfect Completeness
Yumou Fei, Dor Minzer, Shuo Wang
Near-Inverse-Linear Barriers for Explicit Affine Witness Isolation
Sebastian Ben Daniel
∃ R ⊂eq CH
Alex Meiburg
Primal/Dual Method for the Grothendieck Constant
Steven Heilman, Chris Jones, Giulio Malavolta