A method for processing circuit graphics

Abstract

A method for processing circuit graphics, obtaining a description relationship of graphics according to a data structure of the circuit graphics, constructing a chain set and a tree structure of the circuit graphics according to the description relationship of the graphics; merging the hierarchical graphics corresponding to the parent node from the leaf node of the tree structure step by step according to the obtained tree structure and chain set, obtaining a complete graphic of the upper level graphics, until the parent node is the root node, obtaining a complete graphic corresponding to the root node; removing the lines of the obtained complete graphic of the root node to complete the final merger, and obtaining a complete circuit graphics. The present invention divides the entire large graphic into multiple small graphics for multi-threaded merging, reducing the operation time, improving the efficiency, and reducing the memory usage.

Description

Technical Field

[0001] The invention relates to a method for processing circuit graphics, in particular to a method for processing circuit graphics with high graphic repetition. Background Art

[0002] When processing circuit graphics, since the original circuit graphics contain the superposition of multiple graphics, a large number of lines are included in the expression of graphics. If the original circuit graphics are used for processing operations, each line needs to be processed, which takes a long time and affects the processing efficiency of the processing equipment. For example, for direct writing exposure equipment for circuit board graphics, if the original circuit graphics are used, the processing efficiency is greatly reduced, and the original circuit graphics need to be merged. However, since there are many graphics in the circuit graphics, if the graphics are directly merged, the merging calculation time is long and the memory usage is large. Summary of the invention

[0003] In order to solve the above problems, the present invention provides a circuit pattern processing method to reduce the operation time.

[0004] In order to achieve the above-mentioned purpose, the present invention provides a method for processing circuit graphics, which obtains the description relationship of the graphics according to the data structure of the circuit graphics, and constructs a chain set and a tree structure of the circuit graphics according to the description relationship of the graphics; according to the obtained tree structure and chain set, the leaf nodes of the tree structure are merged with the hierarchical graphics corresponding to the parent nodes step by step to obtain the complete graphics of the previous level, until the parent node is the root node, and the complete graphics corresponding to the root node are obtained; the cutting lines of the obtained complete graphics of the root node are removed to complete the final merger to obtain the complete circuit graphics.

[0005] Preferably, in step S1, the repeating units in the circuit pattern are gradually differentiated into multiple levels for expression, and a hierarchical pattern of each level is obtained.

[0006] Preferably, in step S1, the circuit pattern is peeled off layer by layer to a simplest state, wherein the simplest state means that the pattern is at the same level and cannot be split, or is a smallest repeating unit.

[0007] Preferably, in step S1, a model of graphic decomposition is obtained according to the description relationship of the graphics, and a chain set is constructed, wherein the chain set includes elements corresponding to each level of the decomposed graphics, and each element stores the graphic data of the corresponding level of the graphics and the position information of the corresponding level of the graphics; a tree structure is constructed according to the model of graphic decomposition to record the positional relationship between the graphics.

[0008] Preferably, in step S2, the specific method of obtaining the complete graph of the previous level includes:

[0009] S2-1, extract the negative image of the N-th level image corresponding to the current level node, and record it in the N-th element corresponding to the N-th level image in the chain set;

[0010] S2-2, obtaining the preliminary merged graph of the Nth level graph corresponding to the current level node;

[0011] S2-3, search for the parent node of the current layer node in the tree structure, and obtain the N-1th layer graph corresponding to the parent node;

[0012] S2-4. Create a new layer. First, add the N-1th level graphic corresponding to the parent node to the newly created layer to obtain a new layer one. Then, according to the order of the current layer node and the sibling nodes in the tree structure, add the negative graphic of the Nth level graphic corresponding to the current layer node and the preliminary merged graphic of the Nth level graphic to the newly created layer one in turn, complete the graphic merge of the child node and the parent node, and obtain the complete graphic of the N-1th level graphic corresponding to the parent node.

[0013] Preferably, in step S2-2, first search for the Nth element corresponding to the Nth level graph of the current level node in the chain collection, and search whether there is a preliminary merged graph of the Nth level graph corresponding to the current level node in the Nth element; if there is a preliminary merged graph of the Nth level graph, directly call the preliminary merged graph of the Nth level graph; if there is no preliminary merged graph of the Nth level graph, perform a preliminary merge of the Nth level graph corresponding to the current level node, and record the preliminary merged graph of the Nth level graph in the Nth element corresponding to the Nth level graph.

[0014] Preferably, in step S2-2, the preliminary merged graph of the Nth level graph is obtained by cutting the complete graph of the level graph into multiple segments and storing them in a list. After the cutting is completed, all the segments in the list are merged using multi-threading to obtain the preliminary merged graph of the Nth level graph corresponding to the current layer node.

[0015] Preferably, in step S2-2, the method for obtaining the preliminary merged graph of the Nth level graph is as follows: calculate the graph number density of the complete graph of the Nth level graph corresponding to the current level node, wherein the graph number density refers to the ratio of the number of positive graphs and negative graphs contained in the graph to the area of ​​the graph; if the graph number density of the complete graph of the Nth level graph corresponding to the current level node does not exceed the set graph number density threshold, then the complete graph of the level graph is cut into a preset number of segments by cutting and stored in a list; if it exceeds the set graph number density threshold, n cuts are enabled to cut the graph into n times the preset number of segments and store them in a list, so that the graph number density of the preset number of segments is less than the graph number density threshold; after the cutting is completed, all the segments in the list are merged using multithreading to obtain the preliminary merged graph of the Nth level graph corresponding to the current level node.

[0016] Preferably, in step S2-2, if the graph number density of the complete graph of the Nth level graph corresponding to the current layer node does not exceed the set graph number density threshold, the Tianzi cutting method is used to cut the complete graph of the level graph into four segments and store them in a list; if it exceeds the set graph number density threshold, the n-th Tianzi cutting method is used to cut the graph into four segments. n The blocks are stored in a list so that the graph quantity density of the four blocks is less than the graph quantity density threshold. After the cutting is completed, all the blocks in the list are merged using multithreading to obtain the preliminary merged graph of the Nth level graph corresponding to the current layer node.

[0017] Preferably, the data structure of the circuit diagram is in ODB++ file format.

[0018] Compared with the prior art, the present invention divides a large graphic into multiple small graphics blocks for multi-threaded merging, thereby reducing operation time, improving efficiency, and reducing memory usage. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] Figure 1 It is a schematic flow chart of the circuit graphics processing method of the present invention.

[0020] Figure 2 It is a flow chart of obtaining a complete graph of a root node hierarchical graph in the circuit graph processing method of the present invention.

[0021] Figure 3 It is a schematic diagram of pattern differentiation in one embodiment of the circuit pattern processing method of the present invention.

[0022] Figure 4 It is a schematic diagram of a chain collection in an embodiment of the circuit pattern processing method of the present invention.

[0023] Figure 5The tree structure of an embodiment of the circuit pattern processing method of the present invention is shown in FIG. Figure 1 .

[0024] Figure 6 The tree structure of an embodiment of the circuit pattern processing method of the present invention is shown in FIG. Figure 2 .

[0025] Figure 7 It is a schematic diagram of parent nodes and child nodes in a tree structure. DETAILED DESCRIPTION

[0026] In order to make the purpose, technical solutions and advantages of the present invention more clear, the present invention is described below by means of specific embodiments shown in the accompanying drawings.

[0027] The processing method of circuit graphics is described by taking the ODB++ file format of the PCB industry as an example. Figure 1-7 The circuit pattern processing method comprises the following steps.

[0028] S1. Obtain the description relationship of the circuit graph according to the data structure of the circuit graph, and construct a chain set and a tree structure of the circuit graph according to the description relationship of the graph.

[0029] Specifically, the description relationship of the graph is obtained according to the data structure of the graph data, and the repeated units in the graph are gradually differentiated into multiple levels for expression, and the hierarchical graph of each level is obtained, with the bottom-level graph as the first-level graph and the top-level graph as the last-level graph (the Nth-level graph), to obtain the graph decomposition model. Preferably, Figure 3 The graphic decomposition model of the example shown peels the graphic layer by layer to the simplest state, where the simplest state means that the graphic is at the same level and cannot be split, or is the smallest repeating unit. Figure 3 In the example shown, the circuit graphic (layer) is decomposed into three parts: a first-level graphic (layer1), a second-level graphic (layer2) and a third-level graphic (layer3). The number i of first repeating units in the first-level graphic is 1, the number j of second repeating units in the second-level graphic is 4, and the number k of third repeating units in the third-level graphic is 16.

[0030] A chain set is constructed according to the graph decomposition model, the chain set includes elements corresponding to each level of the decomposed graph, each element stores the graph data of the corresponding level of the graph and the position information of the corresponding level of the graph, the number of the corresponding level of position information is the same as the number of the corresponding level of repetition units, and the elements are bidirectionally linked according to the level order. Figure 4 As shown, for Figure 3In the example shown, the chain set includes a first element corresponding to a first-level graph, a second element corresponding to a second-level graph, and a third element corresponding to a third-level graph, and the first element, the second element, and the third element are sequentially bidirectionally linked. The first element contains the data information of the first-level graph and the position information of the first-level graph; the second element contains the data information of the second-level graph and the position information of 4 second-level graphs; the third element contains the data information of the third-level graph and the position information of 16 third-level graphs.

[0031] At the same time, a tree structure is constructed based on the description relationship of the graph, with the first node corresponding to the first level graph as the root node and the node corresponding to the last level graph (Nth level graph) as the leaf node. The positional relationship between the graphs is recorded by constructing a tree structure for subsequent combination. Figure 5-6 Shown in Figure 3 The tree structure established by the example: the first node corresponding to the first-level graph (layer1) is the root node, the node corresponding to the second-level graph (layer2) is the second node, and the third node corresponding to the third-level graph (layer3) is the leaf node.

[0032] There is a corresponding relationship between the chain-like set and the hierarchical graph of the tree structure.

[0033] S2. Based on the obtained tree structure and chain set, the leaf nodes of the tree structure are merged with the hierarchical graphs corresponding to the parent nodes step by step to obtain the complete graph of the previous level graph, until the parent node is the root node, and the complete graph corresponding to the root node is obtained. The hierarchical graph includes positive graphs and negative graphs. The positive graph refers to the part used to represent the displayed graph in the circuit graph, and the negative graph refers to the part of the circuit graph that is covered by the positive graph and does not display the graph. The complete graph of the previous level graph includes the negative graph of the hierarchical graph corresponding to the current level node, the preliminary merged graph of the hierarchical graph corresponding to the current level node, and the hierarchical graph corresponding to the parent node.

[0034] The specific methods for obtaining the complete graphics of the previous level include:

[0035] S2-1. Extract the negative image of the N-th level image corresponding to the current level node (N-th level node), and record it in the N-th element corresponding to the N-th level image in the chain set.

[0036] S2-2, obtain the preliminary merged graph of the level graph corresponding to the current level node (Nth level node). Search the Nth element corresponding to the Nth level graph of the current level node in the chain collection, and check whether the preliminary merged graph of the Nth level graph corresponding to the current level node (Nth level node) exists in the Nth element. If the preliminary merged graph of the Nth level graph exists, directly call the preliminary merged graph of the Nth level graph. If the preliminary merged graph of the Nth level graph does not exist, perform the preliminary merge of the Nth level graph corresponding to the current level node (Nth level node).

[0037] During the initial merging, the graphic number density of the complete graphic of the N-level graphic corresponding to the current layer node (N-th layer node) is calculated, and the graphic number density refers to the ratio of the number of positive graphics and negative graphics contained in the graphic to the area of ​​the graphic. If the graphic number density of the complete graphic of the N-level graphic corresponding to the current layer node (N-th layer node) does not exceed the set graphic number density threshold, the complete graphic of the hierarchical graphic is cut into a preset number of segments and stored in a list by cutting. If it exceeds the set graphic number density threshold, n cuts are enabled to cut the graphic into n times the preset number of segments and store them in a list, so that the graphic number density of the preset number of segments is less than the graphic number density threshold. After the cutting is completed, all the segments in the list are merged using multithreading to obtain the initial merged graphic of the N-level graphic corresponding to the current layer node.

[0038] Preferably, the complete graph of the hierarchical graph is cut by the Tianzi cutting method. If the graph number density of the complete graph of the Nth level graph corresponding to the current layer node (the Nth layer node) does not exceed the set graph number density threshold, the Tianzi cutting method is used to cut the complete graph of the hierarchical graph into four segments and store them in a list. If it exceeds the set graph number density threshold, the n-th Tianzi cutting method is used to cut the graph into four segments. n The blocks are stored in the list so that the graph density of the four blocks is less than the graph density threshold. After the cutting is completed, all the blocks in the list are merged using multithreading to obtain the preliminary merged graph of the Nth level graph corresponding to the current layer node (Nth layer node), and the preliminary merged graph of the Nth level graph is recorded in the Nth element corresponding to the Nth level graph.

[0039] The hierarchical graph of a leaf node is the complete graph of the hierarchical graph corresponding to the leaf node.

[0040] During the processing, the more blocks there are, the shorter the time it takes to merge a single block. However, the more blocks there are, the longer the segmentation time is. When the two processing times conflict, the optimal processing time can be achieved by setting the density threshold of the number of graphics and adapting the appropriate number of cuts. The Tianzi cutting method can be used to obtain the cutting block by cutting two half planes, which is more convenient.

[0041] S2-3. Find the parent node (N-1th layer node) of the current layer node (Nth layer node) in the tree structure, and obtain the N-1th layer graph corresponding to the parent node (N-1th layer node).

[0042] S2-4. Create a new layer 新 ), first add the hierarchical graph corresponding to the parent node (the N-1th layer node) to the new layer (layer 新 ) to get the new layer one (layer 新 '), then according to the order of the current layer node (Nth layer node) and the sibling nodes in the tree structure, add the negative image of the layer graphics corresponding to the current layer node and the preliminary merged image of the layer graphics corresponding to the current layer node to the new layer one (layer 新 '), complete the graph merging of the child node and the parent node, and obtain the complete graph of the hierarchical graph corresponding to the parent node.

[0043] Specifically, Figure 7 The tree structure is shown as an example.

[0044] (1) Add the N-1th level graph corresponding to the parent node (the N-1th node) to the new layer (layer 新 ) to get the new layer one (layer 新 1 ).

[0045] (2) Add the negative image of the level graph corresponding to node N in the current level to the new layer 1. 新 1 ) to get the new layer 2 (layer 新 2 ), and then add the preliminary merged graph of the level graph corresponding to the node N in the current level to the newly obtained layer 2 (layer 新 2 ) in the new layer 3 (layer 新 3 ), complete the graph addition of node N.

[0046] (3) Add the negative image of the level graph corresponding to node M in the current level to the newly created layer 3. 新3 ) to obtain the new layer 4 (layer 新 4 ), and then add the preliminary merged graph of the level graph corresponding to the node M in the current level to the newly obtained layer 4 (layer 新 4 ) in the new layer 5 (layer 新 5 ), complete the graph addition of node M.

[0047] (4) Add the negative image of the level graph corresponding to the node P in the current level to the newly created layer 5. 新 5 ) in the new layer 6 (layer 新 6 ), and then add the preliminary merged graph of the level graph corresponding to the node M in the current level to the newly obtained layer 6 (layer 新 6 ) in the new layer 7 (layer 新 7 ), complete the graph addition of node P.

[0048] (5) Add the negative image of the level graph corresponding to node Q in the current level to the newly created layer 7. 新 7 ) in the new layer 8 (layer 新 8 ), and then add the preliminary merged graph of the level graph corresponding to the node M in the current level to the obtained new layer eight (layer 新 8 ), complete the graph addition of node P and obtain the complete graph of the parent node (the N-1th node).

[0049] When merging complete graphics, you only need to complete the preliminary merging of one level of graphics corresponding to the current layer node, and merge the level graphics corresponding to other current layer nodes into the created new layer (layer 新 ), the preliminary merged graph obtained previously can be directly called through the elements, which greatly reduces the calculation time and improves the efficiency.

[0050] Below Figure 3-Figure 6 The example of step S2 "according to the obtained tree structure, from the leaf nodes of the tree structure, the hierarchical graphs corresponding to the parent nodes are merged level by level to obtain a complete graph of the previous level graph, until the parent node is the root node, and the complete graph corresponding to the root node is obtained" is explained:

[0051] L1. Find all leaf nodes (third nodes) of the tree structure and mark the leaf nodes (third nodes) in the corresponding third element of the linked list.

[0052] L2. Find the third element corresponding to the leaf node (third node) in the chain set, and check whether there is a preliminary merged graph of the third-level graph corresponding to the leaf node (third node) in the third element. If there is a preliminary merged graph of the third-level graph, directly call the preliminary merged graph of the third-level graph. If there is no preliminary merged graph of the third-level graph, perform the preliminary merge operation of the third-level graph of the leaf node (third node).

[0053] During the initial merging, first, the negative image in the third-level image corresponding to the leaf node is recorded in the third element. Then the image number density of the third-level image corresponding to the third node is calculated. If it does not exceed the set image number density threshold, the third-level image is cut into four blocks using the Tianzi cutting method and stored in a list. If it exceeds the set image number density threshold, the n-times Tianzi cutting method is used to cut the image into four blocks. n The blocks are stored in a list so that the graph density of the four blocks is less than the graph density threshold. After the cutting is completed, all the blocks in the list are merged using multithreading to obtain the preliminary merged graph of the leaf node, and the preliminary merged graph of the leaf node is recorded in the third element corresponding to the leaf node.

[0054] L3. Find the parent node (second node) of the leaf node and obtain the second-level graph corresponding to the second node.

[0055] L4. Create a new layer 新1 ), first add the second-level graphics corresponding to the parent node (second node 1) to the new layer (layer 新1 ) to get the new layer one (layer 新1 1 ), and then according to the order of the third node 1, the third node 2, the third node 3 and the third node 4 in the tree structure, add the negative graphics of the third-level graphics corresponding to the third node 1, the third node 2, the third node 3 and the third node 4 and the preliminary merged graphics of the third-level graphics to the new layer 1 (layer 新1 1 ), complete the graph merging of the child nodes (third node 1, third node 2, third node 3 and third node 4) and the parent node (second node 1), and obtain the complete graph of the second-level graph corresponding to the parent node (second node 1).

[0056] L5. Find the second element corresponding to the second node in the chain set, and check whether there is a preliminary merged graph of the second-level graph corresponding to the second node in the second element. If there is a preliminary merged graph corresponding to the second-level graph, directly call the preliminary merged graph corresponding to the second-level graph. If there is no preliminary merged graph corresponding to the second-level graph, perform a preliminary merge operation on the complete graph of the second-level graph of the second node.

[0057] During the initial merging, first, the negative image in the second-level image is recorded in the second element. Then the image number density of the complete image of the second-level image is calculated. If it does not exceed the set image density threshold, the Tianzi cutting method is used to cut the complete image of the second-level image into four segments and store them in a list. If it exceeds the set image number density threshold, the n-time Tianzi cutting method is used to cut the image into four segments. n The segments are stored in a list so that the graphic quantity density of the four segments is less than the graphic quantity density threshold. After the cutting is completed, all the segments in the list are merged using multithreading to obtain a preliminary merged graphic of the second-level graphic, and the preliminary merged graphic of the second-level graphic is recorded in the second element.

[0058] L6. Find the parent node of the second node (the first node) and obtain the first-level graph corresponding to the first node.

[0059] L7. Create a new layer 新2 ), first add the first-level graphics corresponding to the parent node (the first node) to the new layer (layer 新2 ) to get the new layer one (layer 新2 1 ), and then according to the order of the second node 1 and the second node 2 in the tree structure, add the negative image of the second level image and the preliminary merged image of the second level image corresponding to the second node 1 and the second node 2 to the new layer 1 (layer 新2 1 ), complete the graph merging of the child nodes (second node 1 and second node 2) and the parent node (first node), and obtain the complete graph of the first level graph corresponding to the parent node (first node).

[0060] S3, removing the cutting lines of the complete graph of the first node (root node) obtained, completing the final merging, and obtaining a complete circuit graph.

[0061] The above-mentioned circuit graphics processing method divides the entire large graphic into multiple levels, and cuts the level graphics into multiple small graphics for multi-threaded merging. According to the test results of the actual graphics, the efficiency improvement is more obvious for graphics with higher repeatability, and can even reduce the time by up to 90%. In the case of less improvement, it can also reduce the time by 20%. Therefore, it is very effective to use it in circuit graphics with high repeatability such as industrial PCB.

Claims

1. A method for processing a circuit pattern, characterized in that: S1. Obtaining a description relationship of a graph according to a data structure of a circuit graph, obtaining a model of graph decomposition according to the description relationship of the graph, and constructing a chain set, wherein the chain set includes elements corresponding to each level of graph decomposition, and each element stores graph data of the corresponding level of graph and position information of the corresponding level of graph; Construct a tree structure based on the model of graphic decomposition to record the positional relationship between graphics; S2. Based on the obtained tree structure and chain set, the leaf nodes of the tree structure are merged with the hierarchical graphs corresponding to the parent nodes one by one, and the complete graph of the previous level graph is obtained, until the parent node is the root node, and the complete graph corresponding to the root node is obtained; S3, removing the cutting lines of the obtained complete graph of the root node to complete the final merging, and obtaining a complete circuit graph; The complete graph of the previous level graph includes a negative graph of the level graph corresponding to the current level node, a preliminary merged graph of the level graph corresponding to the current level node, and the level graph corresponding to the parent node; The preliminary merged graph of the level graph corresponding to the current level node is obtained by cutting the complete graph of the level graph corresponding to the current level node into a plurality of partition blocks and then merging all the partition blocks using multi-threading.

2. The circuit pattern processing method according to claim 1, characterized in that: In step S1, the repeating units in the circuit pattern are differentiated into multiple levels step by step for expression, and a hierarchical pattern of each level is obtained.

3. The circuit pattern processing method according to claim 1, characterized in that: In step S1, the circuit pattern is peeled off layer by layer to the simplest state, where the simplest state means that the pattern is at the same level and cannot be split, or is the smallest repeating unit.

4. The circuit pattern processing method according to claim 1, characterized in that: In step S2, the specific method of obtaining the complete graph of the previous level includes: S2-1, extract the negative image of the N-th level image corresponding to the current level node, and record it in the N-th element corresponding to the N-th level image in the chain set; S2-2, obtaining the preliminary merged graph of the Nth level graph corresponding to the current level node; S2-3, search for the parent node of the current layer node in the tree structure, and obtain the N-1th layer graph corresponding to the parent node; S2-4. Create a new layer. First, add the N-1th level graphic corresponding to the parent node to the newly created layer to obtain a new layer one. Then, according to the order of the current layer node and the sibling nodes in the tree structure, add the negative graphic of the Nth level graphic corresponding to the current layer node and the preliminary merged graphic of the Nth level graphic to the newly created layer one in turn, complete the graphic merge of the child node and the parent node, and obtain the complete graphic of the N-1th level graphic corresponding to the parent node.

5. The circuit pattern processing method according to claim 4, characterized in that: In step S2-2, firstly, the Nth element corresponding to the Nth level graph of the current level node is searched in the chain set, and whether the preliminary merged graph of the Nth level graph corresponding to the current level node exists in the Nth element; if the preliminary merged graph of the Nth level graph exists, the preliminary merged graph of the Nth level graph is directly retrieved; If there is no preliminary merged graph of the N-th level graph, a preliminary merge of the N-th level graph corresponding to the current layer node is performed, and the preliminary merged graph of the N-th level graph is recorded in the N-th element corresponding to the N-th level graph.

6. The method for processing a circuit pattern according to claim 4 or 5, characterized in that: In step S2-2, the method for obtaining the preliminary merged graph of the Nth level graph is: cutting the complete graph of the level graph into multiple segments and storing them in a list. After the cutting is completed, all the segments in the list are merged using multi-threading to obtain the preliminary merged graph of the Nth level graph corresponding to the current layer node.

7. The circuit pattern processing method according to claim 4 or 5, characterized in that: In step S2-2, the method for obtaining the preliminary merged graph of the Nth level graph is as follows: calculate the graph number density of the complete graph of the Nth level graph corresponding to the current level node, where the graph number density refers to the ratio of the number of positive graphs and negative graphs contained in the graph to the area of ​​the graph; if the graph number density of the complete graph of the Nth level graph corresponding to the current level node does not exceed the set graph number density threshold, then the complete graph of the level graph is cut into a preset number of segments by cutting and stored in a list; if it exceeds the set graph number density threshold, n cuts are enabled to cut the graph into n times the preset number of segments and store them in a list, so that the graph number density of the preset number of segments is less than the graph number density threshold; after the cutting is completed, all the segments in the list are merged using multithreading to obtain the preliminary merged graph of the Nth level graph corresponding to the current level node.

8. The circuit pattern processing method according to claim 7, characterized in that: If the graph number density of the complete graph of the Nth level graph corresponding to the current layer node does not exceed the set graph number density threshold, the Tianzi cutting method is used to cut the complete graph of the level graph into four segments and store them in a list. If it exceeds the set graph number density threshold, the n-th Tianzi cutting method is used to cut the graph into four segments. n The blocks are stored in a list so that the graph quantity density of the four blocks is less than the graph quantity density threshold. After the cutting is completed, all the blocks in the list are merged using multithreading to obtain the preliminary merged graph of the Nth level graph corresponding to the current layer node.

9. The circuit pattern processing method according to claim 1, characterized in that: The data structure of the circuit diagram is in ODB++ file format.

Images