Two-dimensional plate stock layout method

Abstract

The invention relates to the technical field of layout, in particular to a two-dimensional plate stock layout method. The two-dimensional plate stock layout method comprises the following brief steps: obtaining polygons corresponding to parts and side information of the two polygons; salient points of the two polygons are obtained; sorting the edges of the two polygons respectively; obtaining all critical edge sets possibly forming the NFP; connecting the tracks in the critical edge set to generate an adjacency relation; calculating a cross relation between the line segments, and generating and maintaining an adjacency relation; performing validity judgment on each minimum vector unit by utilizing the adjacency relation; and generating candidate polygons, and carrying out intersection judgment on the two polygons to screen out the NFP. According to the l two-dimensional plate stock layout method, the NFP of the part in a convex-convex shape, a concave-convex shape, a convex-concave shape or a concave-concave polygon shape can be calculated to obtain a reasonable layout result, the overall calculation amount and the algorithm complexity are greatly reduced, and the efficiency is higher and the reliability is higher in practical application.

Description

technical field [0001] The present application relates to the technical field of nesting, in particular to a nesting method for two-dimensional plates. Background technique [0002] In the nesting / nesting method, one of the more important problems is the calculation of the critical polygon (NFP). [0003] The calculation of the critical polygon (NFP) is an important part of the typesetting algorithm, and it solves the collision relationship between two polygons A and B. A path is obtained according to the critical polygon. When polygon B moves along this path, the relationship with polygon A is always in contact but not intersect. [0004] In the prior art, the mainstream method for calculating the critical polygon is the moving collision method, and some methods based on the Ghosh slope graph method. The moving collision method is the most classic and intuitive method to solve NFP, that is, according to the docking state of polygons A and B at each moment, analyze the mov...

AI Technical Summary

Problems solved by technology

[0005] Among the existing methods, the mobile collision method has high computational complexity because it requires a large number of polygon intersection judgments

However, the Ghosh slope graph method can only perform better on the NFP calculation of convex-convex or convex-concave polygons, and cannot directly calculate the NFP of concave-concave polygons.

However, in some of the methods for calculating concave-concave polygons extended by it, not only the algorithm logic is more complicated, the time complexity is high, but also very unstable.

Images