Solving the optimization problem of packing of the polyhedrons into a parallelepiped area based on the no-fit polyhedron construction

The current work considers the problem of dense packing of a non-convex polyhedrons into a minimal height parallelepiped container. The no-fit polyhedron based algorithm is proposed to solve described task. The no-fit polyhedrons is used not only for providing conditions of the polyhedrons mutual non-intersection but also for finding the placement points. Some examples and computational results are also given for public input data.