Minimizing cardinality of the set of raster points for orthogonal packing problem

Abstract

We consider the N-dimensional orthogonal packing feasibility problem (OPP-N). Given a set of Ndimensional rectangular items, OOP-N is to decide whether all items can be orthogonally packed into the given rectangular container. We construct a method which finds equivalent packing for given orthogonal packing under certain criterion.