Solving the Problem of Packing Objects of Complex Geometric Shape into a Container of Arbitrary Dimension

Abstract

The article is devoted to algorithms developed for solving the problem of placement orthogonal polyhedrons of arbitrary dimension into a container. To describe all free areas of a container of complex geometric shape is applied the developed model of potential containers. Algorithms for constructing orthogonal polyhedrons and their subsequent placement are presented. The decomposition algorithm intended to reduce the number of orthogonal objects forming an orthogonal polyhedron is described in detail. The proposed placement algorithm is based on the application of intersection operations to obtain the areas of permissible placement of each considered object of complex geometric shape. Examples of packing sets of orthogonal polyhedrons and voxelized objects into containers of various geometric shapes are given. The effectiveness of application of all proposed algorithms is presented on an example of solving practical problems of rational placement of objects produced by 3D printing technology. The achieved layouts exceed the results obtained by the Sinter module of the software Materialise Magics both in speed and density.