№3 (50), 2019

V.A. Chekanin

Algorithms for the placing and deleting of orthogonal polyhedrons of arbitrary dimensionin the cutting and packing problems

The article contains a description of the developed algorithms that provide the placement of orthogonal polyhedrons in containers, as well as their removal from the resulting packing. The developed algorithms are implemented invariantly with respect to the dimension of the problem to be solved, which makes them applicable in solving the problems of cutting and packing of orthogonal polyhedrons of arbitrary dimension.


Keywords: orthogonal polyhedron, cutting and packing problems, placement problem, placing algorithm, deleting algorithm.

[ Back to contents ]
[ Get the article ]