A Practical Algorithm for Rectangle Packing Problem

By use of the rules of deciding-order, deciding-position, placing and space composition, this paper presents heuristic algorithm for two- dimensional rectangle packing problem based on space decomposition. Additionally, aimed to three-dimensional packing problem with constrains of direction, placement and layer, we give the algorithm which transfers three-dimensional packing problem to two-dimensional. Finally, an example shows that the algorithm is feasible and effective.