The 3D objects dense packing problem into a parallelepiped container on basediskrete-logical represantation
Автор: Verkhoturov Mikhail, Verkhoturova Galina, Danilov Konstantin, Yagudin Rustem
Журнал: Известия Самарского научного центра Российской академии наук @izvestiya-ssc
Рубрика: Информационные технологии высокопроизводительных вычислений
Статья в выпуске: 4-2 т.16, 2014 года.
Бесплатный доступ
The current work considers the problem of dense packing ofcomplex objects into a minimal height parallelepiped container. The no-fit polyhedron based algorithm is proposed to solve described task. This algorithm is based on discrete-logical represantation. Some examples and computational results are also given for public input data.
Packing, self-non-intersection conditions of polyhedrons, nesting, hodograph of dense allocation function, no-fit polyhedron, 3-d palletization problem, dense packing of three-dimensional objects
Короткий адрес: https://sciup.org/148203212
IDR: 148203212
