摘要：The problem of 3D geometric objects irregular tight packing into minimal height cuboid is considered. Main approaches to solving this problem are described. The no-fit-polyhedron based algorithm using discrete-logical representation is proposed. Some examples and computational results are also given for public input data.
关键词：packingnestingno-fit-polyhedronnon-intersection conditions of polyhedrons3-D packing problemvoxel
