Tiling with bars under tomographic constraints

Authors:
Christoph Dürr;Eric Goles;Ivan Rapaport;Eric Rémila
Affiliations:
Université de Paris-Sud, LRI bât 490, F-91405 Orsay, France;DIM, Universidad de Chile, casilla 170-3 correo 3, Santiago, Chile;CMM (CNRS UMR 2071) and DIM, Universidad de Chile, Chile;Grima, IUT Roanne, 42334 Roanne cedex, France and LIP, ENS-Lyon, CNRS umr 5668, 69364 Lyon cedex 07, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 3
Cited 8

Reconstruction of domino tiling from its two orthogonal projections

Theoretical Computer Science
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

Theoretical Computer Science
Markov Chain Algorithms for Planar Lattice Structures

SIAM Journal on Computing

On tiling under tomographic constraints

Theoretical Computer Science
The reconstruction of a subclass of domino tilings from two projections

Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Reconstruction of binary matrices under fixed size neighborhood constraints

Theoretical Computer Science
Complexity results for the horizontal bar packing problem

Information Processing Letters
The reconstruction of a subclass of domino tilings from two projections

Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Tile-packing tomography is NP-hard

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
An efficient reconstruction of 2D-tiling with t1,2, t2,1, t1,1 tiles

IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	5.23

Visualization

Abstract

We wish to tile a rectangle or a torus with only vertical and horizontal bars of a given length, such that the number of bars in every column and row equals given numbers. We present results for particular instances and for a more general problem, while leaving open the initial problem.