Descending Packing Algorithm for Irregular Graphics Based on Geometric Feature Points

Abstract

The packing for two-dimensional irregular graphics is one of the NP-complete problems and widely used in industrial applications. In this paper, a descending nesting algorithm for a two-dimensional irregular graph based on geometric feature points is proposed. Before the packing, the parts to be packed are sorted, matched, and spliced, and the matching of the rectangular pieces and the rectangular-like pieces is carried out according to the plate size. On this basis, the geometric feature points of the parts are used to construct the packing baseline, and the packing is accurately carried out according to the principles of the bottom left, the principle of the lowest center of gravity, and combination with virtual moving, rotating collision calculation. The computation of the moving collision distance between the graphics is replaced by the projecting computation of the geometric feature points of the graphic parts, so the computation amount can be reduced. Also, this method is used to test a number of benchmarks examples which are provided by ESICUP (EURO Special Interest Group on Cutting and Packing), which show that the proposed algorithm not only can improve packing but also has better stability and reliability.

Perimeter Calculation of Irregular Shapes Based on the Method of Translating Line Segments

“…First, we should find the lower left point in the view. If the lower left point is the inner point of the arc, the uniqueness of the arc can easily determine the starting search point and the starting search edge [6]. When the image denoising is realized, some original details of the image will be destroyed, making some images unclear and unable to perfectly remove the noise in the image.…”