A note on tiling under tomographic constraints

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

Research output: Contribution to journalArticleAcademicpeer-review

15 Citations (Scopus)
47 Downloads (Pure)


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 1×1 or 1×2 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.
Original languageEnglish
Pages (from-to)2125-2136
JournalTheoretical computer science
Issue number3
Publication statusPublished - 2003


  • Discrete tomography
  • METIS-213200
  • IR-75176
  • Tiling


Dive into the research topics of 'A note on tiling under tomographic constraints'. Together they form a unique fingerprint.

Cite this