| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428164 | Information Processing Letters | 2008 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
