Graph processing method and device, electronic equipment and storage medium

Abstract

The invention relates to a graph processing method and device, electronic equipment and a storage medium, and the method comprises the steps: obtaining all graph pairs in a to-be-analyzed graph set, the graph pairs comprising intersecting graphs; according to the graph direction and / or the boundary relation of each graph pair, the optimal segmentation-combination direction of each graph pair is judged; for the graph pairs with the optimal segmentation-combination direction being the first segmentation-combination direction, performing segmentation-combination processing based on the first segmentation-combination direction to obtain a first combined graph set; and for the graphs in the first combined graph set and the graph pairs which are not subjected to segmentation-combination processing in the to-be-analyzed graph set, based on a second segmentation-combination direction, carrying out segmentation-combination processing on the graphs in the first combined graph set and the graph pairs which are not subjected to segmentation-combination processing. According to the method, the graph pairs are processed based on the optimal segmentation-combination direction of each graph pair, so that the occurrence of slender graphs can be avoided or reduced, and the graph width in the graph set obtained through combination is close to the original design as much as possible, so that the accuracy of circuit analysis is improved.

Description

Technical Field

[0001] The present application relates to the field of integrated circuit technology, and in particular to a graphics processing method, device, electronic device and storage medium. Background Art

[0002] Graphic merging is a basic technology in EDA (Electronic Design Automation) back-end verification design tools. Its purpose is to eliminate the overlapping parts of graphics for subsequent analysis.

[0003] The scan line-based graphics merging algorithm supports batch merging of graphics. Currently, the scan line-based graphics merging algorithm uses a unified scanning direction for all graphics to merge graphics. When the scanning direction is vertical (or "vertical cutting"), the scanning line is vertical, and when the scanning direction is horizontal (or "horizontal cutting"), the scanning line is horizontal.

[0004] like Figure 1 and Figure 2 As shown in the figure, two groups of intersecting figures without connection, when they are cut vertically, one group of figures has vertical thin strips, while the other group of figures does not have thin strips; when they are cut horizontally, one group of figures has horizontal thin strips, while the other group of figures does not have thin strips. Figure 3 and Figure 4 The multiple intersecting graphics shown in the figure, when uniformly cut vertically, vertical thin strips appear, and when uniformly cut horizontally, horizontal thin strips appear. It can be seen that the uniform scanning direction is easy to appear thin strips in the merged graphics. Since the width of the thin strips (the length of the short side of the graphics) is smaller than the width of the original design of the graphics, it will cause the calculation error of the cross-sectional width of the resistor network, thereby affecting the accuracy of the circuit analysis results such as the resistance extraction results and the electromigration calculation results. Summary of the invention

[0005] In response to the above technical problems, the present application provides a graphics processing method, device, electronic device and storage medium, which processes graphic pairs based on the optimal splitting-merging direction of each graphic pair, thereby avoiding or reducing the appearance of slender graphics, and making the graphic width in the merged graphic set as close as possible to the original design, so as to improve the accuracy of circuit analysis.

[0006] In order to solve the above technical problems, the present application provides a graphics processing method, which includes: Acquire all graphic pairs in the graphic set to be analyzed, wherein the graphic pairs include intersecting graphics; Determining the optimal splitting-merging direction of each graphic pair according to the graphic direction and / or boundary relationship of each graphic pair, wherein the optimal splitting-merging direction includes a first splitting-merging direction and a second splitting-merging direction; For a pair of graphics whose optimal splitting-merging direction is the first splitting-merging direction, performing splitting-merging processing based on the first splitting-merging direction to obtain a first merged graphics set; For the graphs of the first merged graph set and the graph pairs in the to-be-analyzed graph set that have not been split-merged, split-merge processing is performed based on the second split-merge direction to obtain a second merged graph set.

[0007] In some embodiments, the determining of the optimal splitting-merging direction of each graphic pair according to the graphic direction and / or boundary relationship of each graphic pair includes: When the directions of the graphics in the graphics pair are all the first direction, the optimal splitting-merging direction of the graphics pair is the first splitting-merging direction; When the directions of the graphics in the graphic pair are all the second direction, the optimal splitting-merging direction of the graphic pair is the second splitting-merging direction; When the directions of the graphics in the graphic pair are respectively the first direction and the second direction, the optimal splitting-merging direction is determined according to the boundary relationship of the graphic pair.

[0008] In some embodiments, determining the optimal split-merge direction according to the boundary relationship of the graphic pair includes: Determine a boundary relationship of the pair of graphics, wherein the boundary relationship includes a first boundary distance and a second boundary distance in the first direction, and a third boundary distance and a fourth boundary distance in the second direction; The optimal split-merge direction is determined according to the magnitude relationship among the first boundary distance, the second boundary distance, the third boundary distance and the fourth boundary distance.

[0009] In some embodiments, determining the optimal split-merge direction according to the relationship among the first boundary distance, the second boundary distance, the third boundary distance, and the fourth boundary distance includes: Taking the smaller value of the first boundary distance and the second boundary distance as a first comparison value, and taking the smaller value of the third boundary distance and the fourth boundary distance as a second comparison value; A distance calculation direction corresponding to a smaller value between the first comparison value and the second comparison value is determined as the optimal split-merge direction.

[0010] The present application also provides a graphics processing method, the method comprising the following steps: Acquire all graphic pairs in the graphic set to be analyzed, wherein the graphic pairs include intersecting graphics; Performing splitting-merging processing on the graphic pair based on a third splitting-merging direction to obtain a third merged graphic set; Extracting target connected graphics from the third merged graphics set; The target connected graphics are split and merged based on a fourth split and merge direction to obtain a fourth merged graphics set.

[0011] In some embodiments, performing a split-merge process on the target connected graphics based on the fourth split-merge direction to obtain a fourth merged graphics set includes: extracting target connected graphics in the third merged graphics set according to the third split-merge direction and the graphic directions of the connected graphics in the third merged graphics set; Performing a splitting-merging process on the target connected graph based on the fourth splitting-merging direction; The processed graphics and the unprocessed graphics in the third combined graphics set are combined to obtain the fourth combined graphics set.

[0012] The present application also provides a graphics processing device, the device comprising: A first graphic acquisition module, used to acquire all graphic pairs in the graphic set to be analyzed, wherein the graphic pairs include intersecting graphics; A first direction determination module, used to determine the optimal splitting-merging direction of each graphic pair according to the graphic direction and / or boundary relationship of each graphic pair, wherein the optimal splitting-merging direction includes a first splitting-merging direction and a second splitting-merging direction; A first processing module, configured to perform a splitting-merging process based on the first splitting-merging direction on a pair of graphics whose optimal splitting-merging direction is the first splitting-merging direction, so as to obtain a first merged graphics set; The second processing module is used to perform split-merge processing based on the second split-merge direction on the graphics of the first merged graphics set and the graphics pairs that have not been split-merged in the graphics set to be analyzed, so as to obtain a second merged graphics set.

[0013] The present application also provides a graphics processing device, the device comprising: A second graphic acquisition module, used to acquire all graphic pairs in the graphic set to be analyzed, wherein the graphic pairs include intersecting graphics; A third processing module, configured to perform a split-merge process on the graphic pair based on a third split-merge direction to obtain a third merged graphic set; An extraction module, used for extracting target connected graphics from the third merged graphics set; The fourth processing module is used to perform a splitting-merging process on the target connected graphics based on a fourth splitting-merging direction to obtain a fourth merged graphics set.

[0014] The present application provides an electronic device, including a storage medium and a controller, wherein a computer program is stored on the storage medium, and when the computer program is executed by the controller, the steps of the above-mentioned graphics processing method are implemented.

[0015] The present application provides a storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the above-mentioned graphics processing method are implemented.

[0016] The graphics processing method of the present application includes: obtaining all graphics pairs in the graphics set to be analyzed, the graphics pairs include intersecting graphics; judging the optimal split-merge direction of each graphics pair according to the graphics direction and / or boundary relationship of each graphics pair, the optimal split-merge direction includes a first split-merge direction and a second split-merge direction; for the graphics pairs whose optimal split-merge direction is the first split-merge direction, split-merge processing is performed based on the first split-merge direction to obtain a first merged graphics set; for the graphics of the first merged graphics set and the graphics pairs in the graphics set to be analyzed that have not been split-merged, split-merge processing is performed based on the second split-merge direction to obtain a second merged graphics set. The present application processes the graphics pairs based on the optimal split-merge direction of each graphics pair, which can avoid or reduce the appearance of thin and long strip graphics, so that the graphics width in the merged graphics set is as close to the original design as possible, so as to improve the accuracy of circuit analysis.

[0017] The graphics processing method of the present application includes: obtaining all graphics pairs in the graphics set to be analyzed, the graphics pairs including intersecting graphics; performing a split-merge process on the graphics pairs based on a third split-merge direction to obtain a third merged graphics set; extracting target connected graphics in the third merged graphics set; performing a split-merge process on the target connected graphics based on a fourth split-merge direction to obtain a fourth merged graphics set. After the present application performs a split-merge process on the graphics pairs in a unified direction, a split-merge process is performed on the target connected graphics, which can avoid or reduce the appearance of slender graphics, so that the graphics width in the merged graphics set is as close to the original design as possible, so as to improve the accuracy of circuit analysis. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] Figure 1 It is a schematic diagram of vertically cutting a pair of figures.

[0019] Figure 2 It is a schematic diagram of a cross-section of a pair of graphics.

[0020] Figure 3 It is a schematic diagram of vertically cutting another pair of figures.

[0021] Figure 4 It is a schematic diagram of a cross-section of another pair of graphics.

[0022] Figure 5 It is a flowchart of a graphics processing method according to an embodiment.

[0023] Figure 6 is a schematic diagram of a graphic set according to an embodiment.

[0024] Figure 7 It is a schematic diagram of splitting and merging the graphic pairs based on the first splitting and merging direction.

[0025] Figure 8 It is a schematic diagram of splitting and merging the graphic pairs based on the second splitting and merging direction.

[0026] Fig. 9 It is a schematic diagram of determining the best splitting-merging direction for graphic pairs with different graphic directions.

[0027] Fig.10 It is a schematic diagram of splitting and merging another set of graphics.

[0028] Fig.11 is a flowchart of a graphics processing method according to another embodiment.

[0029] Fig.12 The diagram is a schematic diagram showing graphic splitting and merging according to another embodiment.

[0030] Fig.13 is a schematic diagram of the structure of a graphics processing device according to an embodiment.

[0031] Fig.14 is a schematic structural diagram of a graphics processing device according to another embodiment. DETAILED DESCRIPTION

[0032] In order to facilitate the understanding of the present application, the present application will be described more fully below with reference to the relevant drawings. The preferred embodiments of the present application are given in the drawings. However, the present application can be implemented in many different forms and is not limited to the embodiments described herein. On the contrary, the purpose of providing these embodiments is to make the disclosure of the present application more thoroughly and comprehensively understood.

[0033] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those generally understood by those skilled in the art to which this application belongs. The terms used herein in the specification of this application are only for the purpose of describing specific embodiments and are not intended to limit this application. The term "and / or" used herein includes any and all combinations of one or more related listed items. In this application, "each" includes one and more than two quantities.

[0034] Figure 5 FIG. 1 is a flow chart of a graphics processing method according to an embodiment. Figure 5 As shown, a graphics processing method of the present application comprises the following steps: S1, obtaining all the graphic pairs in the graphic set to be analyzed, where the graphic pairs include intersecting graphics; S2, determining the optimal splitting-merging direction of each graphic pair according to the graphic direction and / or boundary relationship of each graphic pair, the optimal splitting-merging direction including a first splitting-merging direction and a second splitting-merging direction; S3, for the graphic pair whose optimal splitting-merging direction is the first splitting-merging direction, performing splitting-merging processing based on the first splitting-merging direction to obtain a first merged graphic set; S4, performing a split-merge process based on a second split-merge direction on the graphs of the first merged graph set and the graph pairs in the to-be-analyzed graph set that have not been split-merged, so as to obtain a second merged graph set.

[0035] The set of graphics to be analyzed may include graphic pairs, connected graphics, and independent graphics. Intersection means that there is an overlapping part between two graphics, and the area of ​​the overlapping part is greater than 0; connection means that the two graphics are connected but the area of ​​the overlapping part is equal to 0; independence means that there is no connection between the graphics. The first cutting-merging direction and the second cutting-merging direction are cutting-merging directions with different directions. In one embodiment, the first cutting-merging direction and the second cutting-merging direction are perpendicular to each other. For example, if the first cutting-merging direction is vertical, the second cutting-merging direction may be horizontal, and if the first cutting-merging direction is horizontal, the second cutting-merging direction may be vertical.

[0036] The technical solution of the present application performs graphic processing based on the first split-merge direction and the second split-merge direction to eliminate the overlapping parts of the graphics. Compared with using only one split-merge direction in the processing process, the present application uses two split-merge directions to merge the graphics more flexibly, reducing the probability of thin and long strips of graphics appearing in the merged result, and further, making the width of all graphics in the merged graphic set as close as possible to the original design, so as to improve the accuracy of circuit analysis.

[0037] The slender strip graphic refers to a graphic whose short side is smaller than the short side of the original graphic after the graphics are merged. The original graphic may refer to a graphic that generates a slender strip graphic when merged, or may refer to any graphic in the set of graphics to be analyzed. In this embodiment, a rectangle is mainly used as an example of a graphic. In some embodiments, the graphic may also be a trapezoid or other graphic.

[0038] Among them, for the graphic pairs whose optimal split-merge direction is the first split-merge direction, split-merge processing is performed based on the first split-merge direction. After that, for the graphics of the merged graphic set obtained by the first processing and the graphic pairs in the graphic set to be analyzed that have not been split-merged, split-merge processing is performed based on the second split-merge direction. This is equivalent to merging a part of the graphic pairs in the graphic set to be analyzed, and then merging the remaining graphic pairs for the second time with different split-merge directions. In this way, the split-merge direction used for merging different graphic pairs can be selected more flexibly, thereby reducing the probability of thin and long strips of graphics appearing in the merged result.

[0039] The optimal split-merge direction refers to the split-merge direction that can prevent the appearance of thin and long strips of graphics after the graphics are merged, that is, the width (short side) of the merged graphics is not less than the width of the original graphics. The optimal split-merge direction is not used to determine the order of the split-merge directions. The graphics pairs with the optimal split-merge direction of vertical can be merged first, or the graphics pairs with the optimal split-merge direction of horizontal can be merged first. Therefore, the first split-merge direction and the second split-merge direction are only used to distinguish the first split-merge direction and the second split-merge direction.

[0040] by Figure 6 Take the graphic set shown as an example. There are four graphics A, B, C, and D in the graphic set. Before processing the graphics, all intersecting graphic pairs are found first. This part of the algorithm is the same as the existing technical means and will not be repeated here. Figure 6 In , three groups of graphic pairs are formed between the graphics, that is, graphics A and graphics B are a group of graphic pairs, graphics B and graphics C are a group of graphic pairs, and graphics C and graphics D are a group of graphic pairs. When merging, the optimal splitting-merging direction of each group of graphic pairs is obtained. For example, the graphic pairs of graphics A and graphics B and the graphic pairs of graphics B and graphics C are suitable for vertical cutting, and the graphic pair of graphics C and graphics D are suitable for horizontal cutting. Then, the graphic pair of graphics C and graphics D can be firstly cross-cut (or the graphic pair of graphics A and graphics B and the graphic pair of graphics B and graphics C can be firstly vertically cut), and new graphics E and graphics F are obtained. Graphics E and graphics F are the first merged graphic set. Graphics E and graphics F are summarized with the graphic pairs that have not been split-merged in the original graphic set, such as Figure 7At this time, graphics A, B and new graphics E, F form a new graphics set, in which the graphics form two groups of graphic pairs and one group of connected graphics, graphics A and graphics B form a group of graphic pairs, graphics B and graphics E form a group of graphic pairs, and graphics E and graphics F form a group of connected graphics.

[0041] Among them, the connected and independent graphics are no longer merged. For all the graphic pairs in the summarized graphic set, the second merging process is uniformly performed in the second split-merge direction to further eliminate the overlapping parts of the graphics and obtain the second merged graphic set.

[0042] Continue with Figure 6 As an example, the graphics set shown in Figure 7 and Figure 8 After the first split-merge process, graphics A and graphics B form a pair of graphics, and graphics B and graphics E form a pair of graphics. Therefore, graphics A, B, and E are vertically split again (second split-merge process) to obtain new graphics G, H, and I. At this time, all graphics G, H, I, and F do not overlap with each other, and the graphics are merged. It can be seen that there are no thin strips in the final merged graphics, and the short side size of each graphic is still consistent with the short side size of the original graphics.

[0043] The optimal splitting-merging direction is determined according to the graphic direction of the graphic pair, so that each group of graphic pairs can be merged using the splitting-merging direction that best suits their respective graphic features, thereby reducing the probability of the occurrence of thin and long strips of graphics.

[0044] In some embodiments, the direction of the graphic is based on the direction of the long side of the graphic. For example, when the long side of the graphic is in the vertical direction, the direction of the graphic is vertical, and when the long side of the graphic is in the horizontal direction, the direction of the graphic is horizontal. A group of graphic pairs includes two graphics, and the graphic direction of each group of graphic pairs is determined by the directions of the two graphics. For example, when the direction of the graphic is horizontal or vertical, the direction combinations of the two graphics include both horizontal, both vertical, one horizontal and one vertical. Therefore, the graphic directions of the graphic pairs include both first directions, both second directions, and the first direction and the second direction respectively. The first direction and the second direction are used to distinguish different graphic directions, such as horizontal and vertical.

[0045] In some embodiments, determining the optimal splitting-merging direction of each graphic pair according to the graphic direction and / or boundary relationship of each graphic pair includes: When the directions of the graphics in the graphic pair are all in the first direction, the optimal split-merge direction of the graphic pair is the first split-merge direction; When the directions of the graphics in the graphic pair are all in the second direction, the optimal splitting-merging direction of the graphic pair is the second splitting-merging direction; When the graphic directions in the graphic pair are respectively the first direction and the second direction, the optimal split-merge direction is determined according to the boundary relationship of the graphic pair.

[0046] Taking the first direction as horizontal as an example, if both original graphics are horizontal, then the graphic directions of the graphic pair are all horizontal. Horizontal cutting may cause the width of the original graphics to be destroyed. Therefore, the graphic pair composed of two horizontal graphics should choose vertical cutting, that is, the optimal cutting-merging direction is vertical cutting. In this way, the first cutting-merging direction is a direction perpendicular to the first direction. It can be understood that the angle relationship between the optimal cutting-merging direction and the first direction is based on the shape of the graphic pair. For example, when the graphic pair is two rectangles intersecting horizontally, the optimal cutting-merging direction is a direction perpendicular to the first direction.

[0047] Taking the second direction as vertical as an example, if both original figures are vertical, then the graphic directions of the graphic pair are all vertical. Vertical cutting may cause the width of the original figures to be destroyed. Therefore, the graphic pair composed of two vertical figures should choose horizontal cutting, that is, the optimal cutting-merging direction is horizontal cutting. In this way, the second cutting-merging direction is a direction perpendicular to the second direction. It can be understood that the angle relationship between the optimal cutting-merging direction and the second direction is based on the shape of the graphic pair. For example, when the graphic pair is two rectangles intersecting vertically, the optimal cutting-merging direction is a direction perpendicular to the second direction.

[0048] When the directions of the graphics in the graphic pair are the first direction and the second direction respectively, it means that the graphics in two different directions intersect. At this time, the optimal splitting-merging direction is determined according to the boundary relationship of the graphic pair so that such graphic pairs will not appear as thin and long strips after the graphics are merged.

[0049] Fig. 9 Several pairs of graphics are exemplified, with the directions of the graphics being the first direction and the second direction, respectively, having different degrees of intersection (overlapping areas) and intersection positions. In this case, the optimal splitting-merging direction is determined according to the boundary relationship of the graphic pairs, so that such graphic pairs will not appear as thin and long strips after the graphics are merged.

[0050] In some embodiments, determining the optimal split-merge direction according to the boundary relationship of the graphic pair includes: Determine a boundary relationship of the graphic pair, the boundary relationship including a first boundary distance and a second boundary distance in the first direction, and a third boundary distance and a fourth boundary distance in the second direction; The optimal splitting-merging direction is determined according to the size relationship among the first boundary distance, the second boundary distance, the third boundary distance and the fourth boundary distance.

[0051] Among them, combined Fig. 9Taking (a) as an example, taking the first direction as the horizontal direction and the second direction as the vertical direction as an example, the first boundary distance refers to the distance between the first sides of the two graphics adjacent in the first direction, that is, the distance x1 between the left boundary of the graphic J and the left boundary of the graphic K. The second boundary distance refers to the distance between the second sides of the two graphics adjacent in the first direction, that is, the distance x2 between the right boundary of the graphic J and the right boundary of the graphic K. The third boundary distance refers to the distance between the third sides of the two graphics adjacent in the second direction, that is, the distance y1 between the lower boundary of the graphic J and the lower boundary of the graphic K. The fourth boundary distance refers to the distance between the fourth sides of the two graphics adjacent in the second direction, that is, the distance y2 between the upper boundary of the graphic J and the upper boundary of the graphic K.

[0052] Combination Fig. 9 Taking (b) as an example, taking the first direction as the horizontal direction and the second direction as the vertical direction as an example, the first boundary distance refers to the distance between the first sides of the two graphics adjacent in the first direction, that is, the distance x11 between the left boundary of the graphic U and the left boundary of the graphic V. The second boundary distance refers to the distance between the second sides of the two graphics adjacent in the first direction, that is, the distance x22 between the right boundary of the graphic U and the right boundary of the graphic V. The third boundary distance refers to the distance between the third sides of the two graphics adjacent in the second direction, that is, the distance y11 between the lower boundary of the graphic U and the lower boundary of the graphic V. The fourth boundary distance refers to the distance between the fourth sides of the two graphics adjacent in the second direction, that is, the distance y22 between the upper boundary of the graphic U and the upper boundary of the graphic V.

[0053] It can be seen that the first boundary distance, the second boundary distance, the third boundary distance and the fourth boundary distance can represent the positional relationship between the overlapping area and the graphics when two graphics overlap, and thus can be used to select the best splitting-merging direction.

[0054] In some embodiments, determining the optimal split-merge direction according to the magnitude relationship among the first boundary distance, the second boundary distance, the third boundary distance, and the fourth boundary distance includes: Taking the smaller value of the first boundary distance and the second boundary distance as the first comparison value, and taking the smaller value of the third boundary distance and the fourth boundary distance as the second comparison value; A distance calculation direction corresponding to a smaller value between the first comparison value and the second comparison value is determined as an optimal split-merge direction.

[0055] Among them, since the first comparison value is the smaller value between the first boundary distance and the second boundary distance, the distance calculation direction of the first comparison value is the first direction, and since the second comparison value is the smaller value between the third boundary distance and the fourth boundary distance, the distance calculation direction of the second comparison value is the second direction. It can be seen that the first comparison value and the second comparison value are the widths of the slender strips that may appear, so determining the distance calculation direction corresponding to the smaller value between the first comparison value and the second comparison value as the optimal split-merge direction will not destroy the width of the figure and avoid the appearance of slender strips.

[0056] When calculating the boundary distance, when one of the boundaries used to calculate the boundary distance is completely located in another figure, the boundary distance is less than or equal to 0. At this time, the distance value can be considered infinite, so that it will not be selected as the smaller value when taking a smaller value. This is because when segmenting, the boundary relationship at this location will not lead to the generation of thin strips.

[0057] by Fig. 9 Take the figure pair shown in (a) as an example, take the first comparison value min1 as the minimum value of x1 and x2, take the second comparison value min2 as the minimum value of y1 and y2, if min1 is less than min2, then the optimal split-merge direction is equal to the direction of figure J, otherwise it is equal to the direction of figure K. Wherein, x1 is the distance value obtained by subtracting the horizontal coordinate of the left boundary of figure K from the horizontal coordinate of the left boundary of figure J; x2 is the distance value obtained by subtracting the horizontal coordinate of the right boundary of figure J from the horizontal coordinate of the right boundary of figure K; y1 is the distance value obtained by subtracting the vertical coordinate of the lower boundary of figure J from the vertical coordinate of the lower boundary of figure K; y2 is the distance value obtained by subtracting the vertical coordinate of the upper boundary of figure K from the vertical coordinate of the upper boundary of figure J, where, since the calculation result of y2 is 0, y2=infinity, min1=x2, min2=y1, therefore, min1 is less than min2, the split-merge direction is equal to the direction of figure J, figure J is horizontal, so the optimal split-merge direction is horizontal.

[0058] by Fig. 9Taking the pair of figures shown in (b) as an example, the first comparison value min1 is taken as the minimum value of x11 and x22, and the second comparison value min2 is taken as the minimum value of y11 and y22. If min1 is less than min2, the optimal split-merge direction is equal to the direction of figure U, otherwise it is equal to the direction of figure V. Among them, x11 is the distance value obtained by subtracting the horizontal coordinate of the left boundary of figure V from the horizontal coordinate of the left boundary of figure U; x22 is the distance value obtained by subtracting the horizontal coordinate of the right boundary of figure V from the horizontal coordinate of the right boundary of figure U; y11 is the distance value obtained by subtracting the vertical coordinate of the lower boundary of figure U from the vertical coordinate of the lower boundary of figure V; y22 is the distance value obtained by subtracting the vertical coordinate of the upper boundary of figure V from the vertical coordinate of the upper boundary of figure U, among which, if the calculated result of y22 is less than 0, then y22=infinity, min1=x22, min2=y11, therefore, min1 is less than min2, the splitting-merging direction is equal to the direction of figure U, figure U is horizontal, so the optimal splitting-merging direction is horizontal.

[0059] against Figure 6 For the graphics set shown, the process of graphics processing is as follows: There are four graphics in the graphics set, A, B, C, and D. The graphics form three groups of graphic pairs, namely, graphics A and graphics B form a graphic pair, graphics B and graphics C form a graphic pair, and graphics C and graphics D form a graphic pair. When merging, the optimal split-merge direction of each group of graphic pairs is obtained, where Fig. 9 The judgment method can determine that in the pair of graphics A and graphics B, the distance calculation direction corresponding to the smaller value between the first comparison value and the second comparison value is vertical, which is suitable for merging after vertical cutting; in the pair of graphics B and graphics C, the distance calculation direction corresponding to the smaller value between the first comparison value and the second comparison value is vertical, which is suitable for merging after vertical cutting; in the pair of graphics C and graphics D, the distance calculation direction corresponding to the smaller value between the first comparison value and the second comparison value is horizontal, which is suitable for merging after horizontal cutting.

[0060] Next, we can first make a horizontal cut on the pair of graphs C and D (or we can first make a vertical cut on the pair of graphs A and B, and the pair of graphs B and C), and then get new graphs E and F after splitting and merging. Then, we can summarize the graphs, such as Figure 7 As shown. At this time, graphics A, B and new graphics E, F form a new graphics set. In the new graphics set, the graphics form 2 groups of graphic pairs and 1 group of connected graphics, that is, graphics A and graphics B form a group of graphic pairs, graphics B and graphics E form a group of graphic pairs, and graphics E and graphics F form a group of connected graphics.

[0061] After the first split-merge process, graphics A and graphics B form a graphic pair, and graphics B and graphics E form a graphic pair. Therefore, graphics A, B, and E are vertically split again and then merged to obtain new graphics G, H, and I. At this time, all graphics G, H, I, and F do not overlap with each other, and the split-merge of the graphics is completed.

[0062] Please refer to Fig.10 , for another set of graphics, the process of splitting and merging graphics is illustrated.

[0063] First, there are graphics L, M, N, and O in the graphics set. It can be determined that there are two groups of graphics pairs in the graphics set, that is, graphics L and graphics M are one group of graphics pairs, and graphics N and graphics O are another group of graphics pairs. Fig. 9 The judgment method can determine that in the pair of graphics L and graphics M, the distance calculation direction corresponding to the smaller value of the first comparison value and the second comparison value is horizontal, which is suitable for merging after horizontal cutting. Graphics N and graphics O are a pair of graphics. In this pair of graphics, the distance calculation direction corresponding to the smaller value of the first comparison value and the second comparison value is vertical, which is suitable for merging after vertical cutting. Graphics N and graphics L and M are all connected, not intersecting, and therefore are not included in the combination to be merged.

[0064] Next, cross-cut and merge the group of graphics L and graphics M. After cross-cutting and merging, graphics A and B no longer exist, and new graphics P and Q are formed. Graphics P and Q are combined with graphics N and O to obtain a new graphics set. In the new graphics set, there is a group of graphics pairs, that is, graphics N and graphics O are a group of graphics pairs.

[0065] Finally, the pair of graphics N and O are cut and merged vertically to form new graphics R and S. Finally, the graphics set P, Q, R, S is obtained. It can be seen that there are no long and thin strips in the graphics set.

[0066] It should be noted that the above example can also be performed by first cutting vertically and merging, and then cutting horizontally and merging, and the processing result is the same.

[0067] In the above manner, since the optimal splitting-merging directions of each pair of graphics are determined in sequence when the graphics are splitting-merging, and the graphic pairs are processed in sequence using different optimal splitting-merging directions, the appearance of slender graphics is avoided, and the graphic width in the processed graphic set is made as close as possible to the original design, thereby improving the accuracy of circuit analysis.

[0068] like Fig.11 As shown, a graphics processing method of the present application comprises the following steps: S10, obtaining all graphic pairs in the graphic set to be analyzed, where the graphic pairs include intersecting graphics; S20, performing splitting-merging processing on the graphic pair based on the third splitting-merging direction to obtain a third merged graphic set; S30, extracting target connected graphics from the third merged graphics set; S40, performing a splitting-merging process on the target connected graphics based on a fourth splitting-merging direction to obtain a fourth merged graphics set.

[0069] The main difference from the previous embodiment is that this embodiment first performs a split-merge process on all pairs of graphics in one split-merge direction, and then processes the target connected graphics in another split-merge direction. In this way, even if thin strips of graphics appear after the first split-merge process, targeted merging can be performed again, so that the thin strips of graphics may be further eliminated.

[0070] It is understandable that, in this way, some thin strips may still exist in the final processed graphics, but compared with only one time of segmentation and merging in a unified direction, some thin strips can be eliminated in the second segmentation and merging, thereby achieving the purpose of reducing thin strips. Compared with the previous embodiment, this embodiment does not need to confirm the best segmentation and merging direction of each group of graphics, and has higher processing efficiency.

[0071] Among them, the third cutting-merging direction and the fourth cutting-merging direction are used to distinguish the directions of two scans. In actual implementation, the third cutting-merging direction can be the same as the first cutting-merging direction or the second cutting-merging direction, and the fourth cutting-merging direction can be the same as the second cutting-merging direction or the first cutting-merging direction.

[0072] In some embodiments, performing a split-merge process on the target connected graphics based on the fourth split-merge direction to obtain a fourth merged graphics set includes: Determining a target connected graphic in the third merged graphic set according to the third split-merge direction and the graphic directions of the connected graphics in the third merged graphic set; Performing a splitting-merging process on the target connected graphics based on the fourth splitting-merging direction; The processed graphics and the unprocessed graphics in the third merged graphics set are combined to obtain a fourth merged graphics set.

[0073] The target connected graphics refer to the graphics whose graphics direction is the same as the third split-merge direction among the connected graphics after being merged based on the third split-merge direction. In this case, there are generally thin strips in these connected graphics. Therefore, for these graphics, split-merge again in a direction different from the first split-merge, which may eliminate the thin strips, thereby achieving the purpose of reducing the thin strips.

[0074] by Fig.12 Take the set of graphics shown as an example. Assume that all of them are split and merged horizontally for the first time. Among all the graphics generated in this way, if the two connected graphics are horizontal, then this type of graphics will be split and merged vertically again (the split and merge direction is flipped). It can be found that after processing, the thin strip graphics are eliminated, thereby reducing the appearance of thin strip graphics.

[0075] The graphics processing method of the present application includes: obtaining all graphics pairs in the graphics set to be analyzed, the graphics pairs including intersecting graphics; performing a split-merge process on the graphics pairs based on a third split-merge direction to obtain a third merged graphics set; extracting target connected graphics in the third merged graphics set; performing a split-merge process on the target connected graphics based on a fourth split-merge direction to obtain a fourth merged graphics set. After the present application performs a split-merge process on the graphics pairs in a unified direction, a split-merge process is performed on the target connected graphics, which can avoid or reduce the appearance of slender graphics, so that the graphics width in the merged graphics set is as close to the original design as possible, so as to improve the accuracy of circuit analysis.

[0076] Please refer to Fig.13 , a graphics processing device of the present application comprises: A first graphic acquisition module 141 is used to acquire all graphic pairs in the graphic set to be analyzed, wherein the graphic pairs include intersecting graphics; A first direction determination module 142, configured to determine an optimal splitting-merging direction of each graphic pair according to the graphic direction and / or boundary relationship of each graphic pair, wherein the optimal splitting-merging direction includes a first splitting-merging direction and a second splitting-merging direction; A first processing module 143 is configured to perform a splitting-merging process based on the first splitting-merging direction on a graphic pair whose optimal splitting-merging direction is the first splitting-merging direction, so as to obtain a first merged graphic set graphic pair; The second processing module 144 is configured to perform split-merge processing based on the second split-merge direction on the graphs of the first merged graph set and the graph pairs that have not been split-merged in the to-be-analyzed graph set, so as to obtain a second merged graph set.

[0077] In some embodiments, when determining the optimal splitting-merging direction of each graphic pair according to the graphic direction and / or boundary relationship of each graphic pair, the first direction determination module 142 is used to: When the graphic directions of the graphic pair intersect in the first direction, the optimal splitting-merging direction of the graphic pair is the first splitting-merging direction; When the graphic directions of the graphic pair are intersecting in the second direction, the optimal splitting-merging direction of the graphic pair is the second splitting-merging direction; When the graphic directions of the graphic pair are the first direction and the second direction, the optimal splitting-merging direction is determined according to the boundary relationship of the graphic pair.

[0078] In some embodiments, when determining the optimal split-merge direction according to the boundary relationship of the graphic pair, the first direction determination module 142 is used to: Determine a boundary relationship of the graphic pair, the boundary relationship including a first boundary distance and a second boundary distance in the first direction, and a third boundary distance and a fourth boundary distance in the second direction; The optimal splitting-merging direction is determined according to the size relationship among the first boundary distance, the second boundary distance, the third boundary distance and the fourth boundary distance.

[0079] In some embodiments, when determining the optimal split-merge direction according to the magnitude relationship among the first boundary distance, the second boundary distance, the third boundary distance, and the fourth boundary distance, the first direction determining module 142 is configured to: Taking the smaller value of the first boundary distance and the second boundary distance as the first comparison value, and taking the smaller value of the third boundary distance and the fourth boundary distance as the second comparison value; A distance calculation direction corresponding to a smaller value between the first comparison value and the second comparison value is determined as an optimal split-merge direction.

[0080] like Fig.14 As shown, a graphics processing device comprises: A second graphic acquisition module 151 is used to acquire all graphic pairs in the graphic set to be analyzed, wherein the graphic pairs include intersecting graphics; A third processing module 152, configured to perform a split-merge process on the graphic pair based on the third split-merge direction to obtain a third merged graphic set; An extraction module 153, configured to extract target connected graphics from the third merged graphics set; The fourth processing module 154 is configured to perform a splitting-merging process on the target connected graphics based on the fourth splitting-merging direction to obtain a fourth merged graphics set.

[0081] In some embodiments, when the target connected graphics are split-merged based on the fourth split-merge direction to obtain a fourth merged graphics set, the fourth processing module 152 is used to: extracting target connected graphics in the third merged graphics set according to the third split-merge direction and the graphic directions of the connected graphics in the third merged graphics set; Performing a splitting-merging process on the target connected graph based on the fourth splitting-merging direction; The processed graphics and the unprocessed graphics in the third combined graphics set are combined to obtain the fourth combined graphics set.

[0082] The specific working process of each of the above modules is detailed in the description of the method embodiment and will not be repeated here.

[0083] The present application provides an electronic device, including a storage medium and a controller. The storage medium stores a computer program, and when the computer program is executed by the controller, the steps of the above graphics processing method are implemented.

[0084] The present application provides a storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of the above-mentioned graphics processing method are implemented.

[0085] The specific working process of each of the above modules is detailed in the description of the method embodiment and will not be repeated here.

[0086] The present application provides an electronic device, including a storage medium and a controller, wherein a computer program is stored on the storage medium, and when the computer program is executed by the controller, the steps of the above-mentioned graphics processing method are implemented.

[0087] The present application provides a storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the above-mentioned graphics processing method are implemented.

[0088] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.

Claims

1. A graphics processing method, characterized in that: The method comprises: Acquire all graphic pairs in the graphic set to be analyzed, wherein the graphic pairs include intersecting graphics; Determining the optimal splitting-merging direction of each graphic pair according to the graphic direction and / or boundary relationship of each graphic pair, wherein the optimal splitting-merging direction includes a first splitting-merging direction and a second splitting-merging direction; For a pair of graphics whose optimal splitting-merging direction is the first splitting-merging direction, performing splitting-merging processing based on the first splitting-merging direction to obtain a first merged graphics set; For the graphs of the first merged graph set and the graph pairs in the to-be-analyzed graph set that have not been split-merged, split-merge processing is performed based on the second split-merge direction to obtain a second merged graph set.

2. The method according to claim 1, characterized in that: The step of determining the optimal splitting-merging direction of each graphic pair according to the graphic direction and / or boundary relationship of each graphic pair includes: When the directions of the graphics in the graphics pair are all the first direction, the optimal splitting-merging direction of the graphics pair is the first splitting-merging direction; When the directions of the graphics in the graphic pair are all the second direction, the optimal splitting-merging direction of the graphic pair is the second splitting-merging direction; When the directions of the graphics in the graphic pair are respectively the first direction and the second direction, the optimal splitting-merging direction is determined according to the boundary relationship of the graphic pair.

3. The method according to claim 2, characterized in that The determining the optimal splitting-merging direction according to the boundary relationship of the graphic pair includes: Determine a boundary relationship of the pair of graphics, wherein the boundary relationship includes a first boundary distance and a second boundary distance in the first direction, and a third boundary distance and a fourth boundary distance in the second direction; The optimal splitting-merging direction is determined according to the magnitude relationship among the first boundary distance, the second boundary distance, the third boundary distance and the fourth boundary distance.

4. The method according to claim 3, characterized in that The determining the optimal splitting-merging direction according to the magnitude relationship among the first boundary distance, the second boundary distance, the third boundary distance, and the fourth boundary distance includes: Taking the smaller value of the first boundary distance and the second boundary distance as a first comparison value, and taking the smaller value of the third boundary distance and the fourth boundary distance as a second comparison value; A distance calculation direction corresponding to a smaller value between the first comparison value and the second comparison value is determined as the optimal split-merge direction.

5. A graphics processing method, characterized in that: The method comprises the following steps: Acquire all graphic pairs in the graphic set to be analyzed, wherein the graphic pairs include intersecting graphics; Performing splitting-merging processing on the graphic pair based on a third splitting-merging direction to obtain a third merged graphic set; Extracting target connected graphics from the third merged graphics set; The target connected graphics are split and merged based on a fourth split and merge direction to obtain a fourth merged graphics set.

6. The method according to claim 5, characterized in that The step of performing a splitting-merging process on the target connected graphics based on the fourth splitting-merging direction to obtain a fourth merged graphics set includes: extracting target connected graphics in the third merged graphics set according to the third split-merge direction and the graphic directions of the connected graphics in the third merged graphics set; Performing a splitting-merging process on the target connected graph based on the fourth splitting-merging direction; The processed graphics and the unprocessed graphics in the third combined graphics set are combined to obtain the fourth combined graphics set.

7. A graphics processing device, characterized in that: The device comprises: A first graphic acquisition module, used to acquire all graphic pairs in the graphic set to be analyzed, wherein the graphic pairs include intersecting graphics; A first direction determination module, used for determining the optimal splitting-merging direction of each graphic pair according to the graphic direction and / or boundary relationship of each graphic pair, wherein the optimal splitting-merging direction includes a first splitting-merging direction and a second splitting-merging direction; A first processing module, configured to perform a splitting-merging process based on the first splitting-merging direction on a pair of graphics whose optimal splitting-merging direction is the first splitting-merging direction, so as to obtain a first merged graphics set; The second processing module is used to perform split-merge processing based on the second split-merge direction on the graphics of the first merged graphics set and the graphics pairs that have not been split-merged in the graphics set to be analyzed, so as to obtain a second merged graphics set.

8. A graphics processing device, characterized in that: The device comprises: A second graphic acquisition module, used to acquire all graphic pairs in the graphic set to be analyzed, wherein the graphic pairs include intersecting graphics; A third processing module, configured to perform a split-merge process on the graphic pair based on a third split-merge direction to obtain a third merged graphic set; An extraction module, used for extracting target connected graphics from the third merged graphics set; The fourth processing module is used to perform a splitting-merging process on the target connected graphics based on a fourth splitting-merging direction to obtain a fourth merged graphics set.

9. An electronic device, comprising a storage medium and a controller, characterized in that: The storage medium stores a computer program, and when the computer program is executed by the controller, the steps of the graphics processing method according to any one of claims 1 to 6 are implemented.

10. A storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the graphics processing method according to any one of claims 1 to 6 are implemented.

Images