Complexity results for the horizontal bar packing problem

Authors:
Fethi Jarray;Marie-Christine Costa;Christophe Picouleau
Affiliations:
CEDRIC, CNAM, 292 rue St-Martin, 75141 Paris cedex 03, France and Gabes University of Sciences, 6072 Gabes, Tunisia;CEDRIC, CNAM, 292 rue St-Martin, 75141 Paris cedex 03, France;CEDRIC, CNAM, 292 rue St-Martin, 75141 Paris cedex 03, France
Venue:
Information Processing Letters
Year:
2008

Citing 4
Cited 0

Reconstructing convex polyominoes from horizontal and vertical projections

Theoretical Computer Science
Reconstruction of domino tiling from its two orthogonal projections

Theoretical Computer Science
Tiling with bars under tomographic constraints

Theoretical Computer Science
Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis)

Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis)

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper deals with the packing of a grid by horizontal bars while respecting given orthogonal projections and several constraints of distance between the consecutive bars. We show that packing under a maximal or uniform distance is an NP-complete problem. We also give a polynomial time algorithm to solve the packing problem under a minimal distance.