Two-dimensional plate layout method

Abstract

The present application relates to the technical field of nesting, in particular to a nesting method for two-dimensional plates. The nesting method of two-dimensional plates includes the following brief steps: obtain the polygon corresponding to the part and the edge information of the two polygons; obtain the convex points of the two polygons; sort the edges of the two polygons respectively; obtain all the critical edges that may form NFP set; connect the trajectories in the critical edge set to generate an adjacency relationship; calculate the intersection relationship between line segments, generate and maintain the adjacency relationship; use the adjacency relationship to determine the validity of each minimum vector unit; generate candidate polygons, and perform two Polygon intersection judgment screens out NFP. The layout method of two-dimensional plates provided by this application can calculate the NFP of parts in the shape of convex-convex, concave-convex, concave-convex or concave-concave polygons to obtain reasonable layout results. This method greatly reduces the overall calculation amount and algorithm Complexity, not only more efficient, but also more reliable in practical applications.

Description

technical field [0001] The present application relates to the technical field of layout, in particular to a layout method of 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, which solves the collision relationship between the 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 intersecting. [0004] In the prior art, the mainstream methods for calculating critical polygons are the moving collision method and some methods extended based on the Ghosh slope graph method. The moving collision method is the most classic and intuitive method for solving NFP, that is, according to the contact state of polygons A and B at each moment, an...

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