A packing problem for parallelepipeds

Abstract This article discusses finite sets of disjoint, closed, axis-parallel parallelepipeds (“boxes”) in 3-space which have the property that their projections on the coordinate planes each fill a rectangle. Omitting the trivial case of just one box, then it is proved that 12 boxes are necessary and sufficient to form such a set. The minimal solution is described in detail.