Application of Algorithms for Placement of Orthogonal Polyhedrons for Solving the Problems of Packing Objects of Complex Geometric Shape

Abstract

The article is devoted to the development and research of algorithms for placing objects of complex geometric shapes. To solve the placement problem is proposed an approach which consists in transforming the shape of all objects and further application of the developed algorithm for placing orthogonal polyhedrons of arbitrary dimension to the resulting transformed objects. In the process of transforming the shape of the objects being placed, they are initially voxelized, after which the developed decomposition algorithm is applied to the resulting voxelized objects, which provides the formation of orthogonal polyhedrons consisting of the largest possible orthogonal objects. The proposed model of potential containers is used to describe the free space of containers as a set of orthogonal areas. The developed algorithm for the placement of orthogonal polyhedrons provides a fast solution to NP-hard problems of placing objects of complex geometric shapes without resorting to the use of time-consuming nonlinear programming methods. Examples of the practical application of the developed algorithms for modeling the dense layout of parts of complex geometric shapes on the platform of a 3D printer are given.