Complexity results for the horizontal bar packing problem

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.