Solving the Problem of Dense Packing of Objects of Complex Geometry

Chekanin, Vladislav A.; Chekanin, Alexander V.

doi:10.1007/978-3-030-91553-7_12

Cited by 4 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among the advantages of the method of solving the problems of packing objects in the form of an OP in comparison with the traditional methods of forming irregular packing of vector or polygonal objects, it should be noted the possibility of specifying arbitrary geometry of objects and containers to be placed, a complete analysis of all free areas inside the formed placement scheme, as well as the ability to control the speed and accuracy of the solution by changing the degree of detail of objects during their rasterization (voxelization) at the preprocessor stage of preparing the solution of the problem (this issue is considered in [30]).…”

Section: Discussionmentioning

confidence: 99%

Investigation of the Possibilities of Optimizing the Model of Potential Containers to Increase the Speed of Placement of Orthogonal Polyhedra

Chekanin

2022

Proceedings of the 32nd International Conference on Computer Graphics and Vision

View full text Add to dashboard Cite

An optimization problem of packing objects of arbitrary geometry with generalization in dimension is considered. It is proposed to use a discrete representation of objects of complex shape in the form of orthogonal polyhedra, which are compound objects obtained by combining rectangles or parallelepipeds depending on the dimension of the problem. The model of potential containers is used to form and describe the placement schemes of orthogonal polyhedra. The paper proposes algorithms that provide a qualitative increase in the speed of formation of the placement schemes by reducing the number of potential containers processed when placing each compound object. A fast algorithm for updating sets of potential containers is presented, which is based on the use of the set-theoretic operation of intersection. An additional increase in the speed of the potential containers model is achieved by removing potential containers that cannot be used to place new objects in all possible orientations. It is shown that with an increase in the number of objects placed using the proposed algorithms, the time spent on placing one object is reduced. The proposed optimization makes it possible to solve the problems of placing objects of complex shape, specified with a higher degree of detail, which will provide a denser packing in the allotted time. The results of the computational experiments carried out on the problems of packing flat and volumetric objects of irregular shape are presented, confirming the effectiveness of the developed algorithms.

show abstract

Section: Discussionmentioning

confidence: 99%