Method and device for processing intersecting graph in chip layout, and electronic equipment

By processing intersecting graphics based on the relative positions of the graphics in the chip layout, the problem of inconsistency in the processing results caused by random slicing methods in the prior art is solved, and the accuracy of circuit analysis is improved.

CN119886032APending Publication Date: 2025-04-25SHANGHAI XINGXIN TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411929439.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-12-24
Publication Date
2025-04-25

AI Technical Summary

Technical Problem

When the prior art processes intersecting patterns in the chip layout, the slicing method is random, resulting in inconsistent processing results of intersecting patterns of the same structure in different grids, affecting the accuracy of circuit analysis.

Method used

The intersection graphics are processed based on the relative positions of the graphics, the intersection type is determined and the corresponding processing methods are adopted, including graphics deletion and slicing processing, ensuring that the intersection graphics of the same structure has a unified processing method in different grids.

Benefits of technology

The accuracy of circuit analysis is improved through a unified processing method, errors caused by random segmentation method are avoided, and the consistency of the same structural graphics in different grids is ensured.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119886032A_ABST
    Figure CN119886032A_ABST
Patent Text Reader

Abstract

The invention relates to a processing method and device for an intersected graph in a chip layout, electronic equipment and a storage medium, and the method comprises the steps: determining a target intersected graph in a chip layout graph, and the target intersected graph comprises a first graph and a second graph which are intersected; according to the relative position of the first graph and the second graph, the target intersection graph is processed to obtain non-overlapped graphs, and processing comprises at least one of graph deletion processing, graph segmentation processing and graph deletion processing in sequence. According to the technical scheme, the intersecting graph is processed based on the relative position of the graph, it is ensured that the same intersecting graph structure has a unified processing mode in different grids, and the accuracy of circuit analysis is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of integrated chip packaging structures, and in particular to a method, device, electronic device and storage medium for processing intersecting graphics in a chip layout. Background Art

[0002] As the integration of chips continues to increase, the files describing the physical information of chips are becoming larger and larger. Usually, the entire chip is divided into multiple areas for separate processing, and the results are integrated after each area is processed. When dividing the area, the most common way is to use vertical and horizontal lines to divide the entire chip area (which can be abstracted into a large rectangle) into m*n grids (Bin Part) along the horizontal n grids and vertical m grids.

[0003] When processing intersecting graphics in a grid, the prior art first determines the direction of the grid and then processes the graphics based on the direction of the grid. That is, no matter how the intersecting graphics overlap, they are uniformly segmented according to the direction of the grid. For example, cutting the graphics will cause the processing results of intersecting graphics with the same structure in different grids to have a certain degree of randomness. For example, when Figure 1 When the intersecting figures shown are in grids of different directions, they may be segmented horizontally or vertically, resulting in different segmentation results. Figure 2 When the intersecting figures shown are in grids of different directions, they may be segmented horizontally or vertically, resulting in different segmentation results.

[0004] The randomness of this segmentation result will directly affect the subsequent node generation, current direction determination and resistance value calculation scheme, thereby affecting the accuracy of circuit analysis. Summary of the invention

[0005] In response to the above technical problems, the present application provides a method, device, electronic device and storage medium for processing intersecting graphics in a chip layout, which processes the intersecting graphics based on the relative position of the graphics to ensure that the same intersecting graphic structure has a unified processing method in different grids, so as to improve the accuracy of circuit analysis.

[0006] In order to solve the above technical problems, the present application provides a method for processing intersecting graphics in a chip layout, the method comprising the following steps: Determine a target intersection figure in the chip layout figure, wherein the target intersection figure includes an intersecting first figure and a second figure; According to the relative position of the first graphic and the second graphic, the target intersecting graphic is processed to obtain a non-overlapping graphic, and the processing includes at least one of only performing graphic deletion processing, performing graphic segmentation processing and graphic deletion processing in sequence.

[0007] In some embodiments, determining a target intersection graph in a chip layout graph includes: Obtaining a current set of intersecting graphics to be processed, wherein the set of intersecting graphics includes two or more graphics; Obtaining the number of overlapping areas in the set of intersecting graphics; If the number of the overlapping regions is greater than one, determining a target overlapping region according to the positions of the overlapping regions; The two intersecting graphs corresponding to the target overlapping area are used as the target intersecting graphs.

[0008] In some embodiments, the step of obtaining the set of intersecting graphics to be processed currently includes at least one of the following: Acquire graphic overlap information, and determine the set of intersecting graphics according to the graphic overlap information; The graphic overlap information is updated according to the overlapping relationship between the graphics that have completed the processing and the graphics to be processed in the intersecting graphic set to which they belong, and the intersecting graphic set is determined according to the updated graphic overlap information.

[0009] In some embodiments, the processing of the target intersecting graphics to obtain non-overlapping graphics according to the relative positions of the first graphics and the second graphics includes: Determining the intersection type between the first graphic and the second graphic according to the relative positions of the first graphic and the second graphic; According to a processing method corresponding to the intersection type of the first graphic and the second graphic, the target intersection graphic is processed to obtain non-overlapping graphics.

[0010] In some embodiments, the relative position is characterized based on a relative relationship of boundary coordinates of the graphics, and determining the intersection type between the first graphics and the second graphics according to the relative position of the first graphics and the second graphics includes: Obtaining coordinates of each boundary of the first figure and the second figure; Determining a relative relationship between coordinates of each boundary of the first figure and coordinates of each boundary of the second figure; An intersection type corresponding to the relative relationship is acquired as the intersection type between the first graphic and the second graphic.

[0011] In some embodiments, the intersection type includes at least one of edge intersection, area intersection, and angle intersection; The area intersection includes the first figure and the second figure overlapping and intersecting without a boundary; The edge intersection includes that only one boundary of the first figure intersects with the second figure or two opposite boundaries of the first figure intersect with two opposite boundaries of the second figure; The angle intersection includes a vertex angle of the first figure intersecting with a vertex angle of the second figure.

[0012] In some embodiments, the processing of the target intersection graphic to eliminate the overlap between the graphics according to the intersection type between the first graphic and the second graphic comprises at least one of the following: When the intersection type is area intersection, deleting the smaller figure between the first figure and the second figure to obtain non-overlapping figures; When the intersection type is edge intersection, performing a graphic segmentation process and a graphic deletion process according to the boundary where the first graphic and the second graphic intersect, so as to obtain non-overlapping graphics; When the intersection type is an angular intersection, a graphic segmentation process and a graphic deletion process are performed according to the graphic directions of the first graphic and the second graphic and the intersecting boundary to obtain non-overlapping graphics.

[0013] In some embodiments, the step of performing a graphic segmentation process and a graphic deletion process according to a boundary where the first graphic and the second graphic intersect, includes: Using the boundary where the first figure intersects with the second figure as a dividing line, dividing the second figure; The portion of the second graphic that is segmented and located in the first graphic is deleted.

[0014] In some embodiments, when only one boundary of the first graphic intersects with the second graphic, after deleting the portion of the second graphic that is segmented and located in the first graphic, the method further includes: Determine whether the lengths or widths of the processed graphics are consistent; If yes, the processed graphics are merged.

[0015] In some embodiments, when the intersection type is an angular intersection, the graphic segmentation and graphic deletion according to the graphic directions and the intersection boundary of the first graphic and the second graphic include at least one of the following: When the graphic directions of the first graphic and the second graphic are the same, a graphic segmentation process is performed based on the boundary of the first graphic and the boundary of the second graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle, and then a graphic segmentation process and a graphic deletion process are performed on the intersecting graphics in the graphics obtained by the segmentation process; When the graphic directions of the first graphic are the same or different from those of the second graphic, the second graphic is segmented based on the boundary perpendicular to the graphic direction of the second graphic corresponding to the vertex angle of the first graphic, and then the intersecting graphics in the graphics obtained by the segmentation are segmented and deleted.

[0016] In some embodiments, when the graphic directions of the first graphic and the second graphic are the same, a graphic segmentation process is performed based on the boundary of the first graphic and the boundary of the second graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle, and then a graphic segmentation process and a graphic deletion process are performed on the intersecting graphics in the graphics obtained by the segmentation process, and the method further includes: The graphics obtained by processing the intersecting graphics are merged.

[0017] The present application also provides a device for processing intersecting graphics in a chip layout, the device comprising: An intersection graph determination module, used to determine a target intersection graph in a chip layout graph, wherein the target intersection graph includes an intersecting first graph and a second graph; A segmentation processing module is used to process the target intersecting graphics according to the relative position of the first graphics and the second graphics to obtain non-overlapping graphics, wherein the processing includes only performing graphic deletion processing, performing graphic segmentation processing and graphic deletion processing in sequence, and at least one of the above.

[0018] The present application also provides an electronic device, including a storage medium and a controller, characterized in that a computer program is stored on the storage medium, and when the computer program is executed by the controller, the steps of the method for processing intersecting graphics in the chip layout as described above are implemented.

[0019] The present application also provides a storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of the method for processing intersecting graphics in a chip layout as described above are implemented.

[0020] The present application discloses a method, device, electronic device and storage medium for processing intersecting graphics in a chip layout. The method includes: determining a target intersecting graphic in a chip layout graphic, wherein the target intersecting graphic includes an intersecting first graphic and a second graphic; processing the target intersecting graphic according to the relative position of the first graphic and the second graphic to obtain a non-overlapping graphic, wherein the processing includes at least one of only performing graphic deletion processing, performing graphic segmentation processing in sequence and performing graphic deletion processing. The technical solution of the present application processes intersecting graphics based on the relative position of the graphics, ensuring that the same intersecting graphic structure has a unified processing method in different grids to improve the accuracy of circuit analysis. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Figure 1 It is a schematic diagram of horizontally and vertically dividing an intersecting figure.

[0022] Figure 2 It is a schematic diagram of horizontally and vertically dividing another intersecting figure.

[0023] Figure 3 The present invention is a flowchart of a method for processing intersecting graphics in a chip layout according to an embodiment.

[0024] Figure 4 is a schematic diagram showing different relative positions between intersecting graphics according to an embodiment.

[0025] Figure 5 According to an embodiment, Figure 4 Schematic diagram of processing intersection graphics of the intersection type shown in (g).

[0026] Figure 6 According to an embodiment, Figure 4 Schematic diagram of another processing of an intersection graph of the intersection type shown in (g).

[0027] Figure 7 According to an embodiment, Figure 4 Schematic diagram of the intersection type shown in (h) after processing the intersection graph.

[0028] Figure 8 It is a schematic diagram of the structure of a device for processing intersecting graphics in a chip layout according to an embodiment. DETAILED DESCRIPTION

[0029] In order to facilitate the understanding of the present invention, the present invention will be described more fully below with reference to the relevant drawings. The preferred embodiments of the present invention are given in the drawings. However, the present invention 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 invention more thoroughly understood.

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

[0031] Figure 3FIG. 1 is a flow chart showing a method for processing intersecting graphics in a chip layout according to an embodiment. Figure 3 As shown, a method for processing intersecting graphics in a chip layout of the present application comprises the following steps: S1, determining a target intersecting figure in a chip layout figure, where the target intersecting figure includes an intersecting first figure and a second figure; S2, processing the target intersecting graphics according to the relative positions of the first graphics and the second graphics to obtain non-overlapping graphics, wherein the processing includes at least one of only performing graphics deletion processing, performing graphics segmentation processing and graphics deletion processing in sequence.

[0032] The intersection means that the area of ​​the overlapped part between the first figure and the second figure is greater than zero. The direction of the figure is related to the coordinate span ∆x of the figure on the x-axis and the coordinate span ∆y of the figure on the y-axis, where the figure with ∆x greater than ∆y corresponds to the horizontal direction, and the figure with ∆y greater than ∆x corresponds to the vertical direction. The relative position of the first figure and the second figure is determined according to the coordinates of each boundary of the figure. If the coordinate range of the boundary of the figure on the x-axis and the coordinate range on the y-axis overlap, the figures are considered to intersect and have an overlapping area.

[0033] The graphic segmentation process refers to segmenting the first graphic or the second graphic so as to separate the part of the graphic that intersects with the other graphic and the part of the graphic that does not intersect with the other graphic. The graphic deletion process may be to delete the first graphic or the second graphic, or to delete a part of the graphic after segmentation. Through the process, the graphics finally obtained do not overlap each other.

[0034] By processing according to the relative positions of the first graphic and the second graphic, various intersecting structures of the intersecting graphics can be covered. The direction of the grid is no longer used as a reference during processing, ensuring that the same intersecting graphic structure has a unified processing method in different grids to improve the accuracy of circuit analysis.

[0035] In some embodiments, in step S1, determining a target intersection graph in a chip layout graph includes: Obtaining a set of intersecting graphics to be processed, where the set of intersecting graphics includes two or more graphics; Get the number of overlapping areas in the intersecting graphics set; If the number of overlapping regions is greater than one, the target overlapping region is determined according to the position of the overlapping regions; The two intersecting figures corresponding to the target overlapping area are taken as the target intersecting figures.

[0036] Among them, the graphics that intersect with each other are used as the basic unit in the intersection graphics set for graphics processing. The overlapping part between the graphics that intersect with each other is the overlapping area. When the number of overlapping areas in the intersection graphics set is only one, it means that there are only two graphics that intersect with each other in the intersection graphics set. The area that intersects with each other can be directly used as the target intersection graphics, and the two graphics are directly processed. When the number of overlapping areas in the intersection graphics set is greater than one, a group of graphics that intersect with each other is determined as the target intersection graphics according to the position of the overlapping area and the preset processing order for processing.

[0037] In some embodiments, the coordinates of the lower left corner of the overlapped area may be used as a reference, and the items may be processed one by one in a left-to-right, bottom-to-top order. It is understood that the reference coordinate points and the processing order may be set as required, for example, the coordinates of the upper left corner of the overlapped area may be used, and the items may be processed one by one in a left-to-right, top-to-bottom order, which is not limited here.

[0038] In some embodiments, obtaining the current set of intersecting graphics to be processed includes at least one of the following: Obtaining graphic overlap information, and determining a set of intersecting graphics according to the graphic overlap information; According to the overlapping relationship between the processed graphics and the graphics to be processed in the intersecting graphics set, the graphics overlapping information is updated, and the intersecting graphics set is determined according to the updated graphics overlapping information.

[0039] As the processing proceeds, the current set of intersecting graphics to be processed may be an initial set of intersecting graphics, or a set of intersecting graphics obtained after some of the intersecting graphics have been processed. The initial set of intersecting graphics refers to a set of intersecting graphics for which no intersecting graphics have been processed.

[0040] When obtaining the initial set of intersecting graphics, all graphics are scanned. When a grid is used to divide the chip, all graphics in the currently processed grid can be scanned to obtain a set of graphics to be scanned in the grid, or the graphics to be scanned can also be a set of graphics selected by the user. In the process of scanning the graphics, a record is made when one side boundary of one of the graphics is scanned, and the scanning of the graphics is ended when the other side boundary is scanned. After completing the scanning of all graphics, each graphic and the graphics that overlap with it are recorded to obtain graphic overlap information, wherein the graphic overlap information includes the number of overlapping areas, the location of the overlapping areas, the intersecting graphics corresponding to each overlapping area, etc. Furthermore, multiple groups of intersecting graphics can be determined based on the graphic overlap information to obtain a set of intersecting graphics. The scanning direction can be the x-axis direction or the y-axis direction.

[0041] After starting to process the intersecting graphs, each time a group of intersecting graphs is processed, the generated new graph may overlap with the original graph group. Therefore, the graph overlap information needs to be updated, and the intersecting graph set is re-determined based on the updated graph overlap information. After updating the graph overlap information, the next target overlap area to be processed is re-determined based on the position of the overlap area, and the two intersecting graphs corresponding to the target overlap area are used as the target intersecting graphs.

[0042] In some embodiments, step S2, processing the target intersecting graphics to obtain non-overlapping graphics according to the relative positions of the first graphics and the second graphics, includes: Determining the intersection type between the first figure and the second figure according to the relative position of the first figure and the second figure; According to the processing manner corresponding to the first graphic and the second graphic and the intersection type, the target intersection graphic is processed to obtain non-overlapping graphics.

[0043] The intersection type summarizes the characteristics of the relative positions of the first graphic and the second graphic. By adopting a corresponding strategy for graphic processing based on the intersection type, it can be ensured that intersecting graphics of the same intersection type are processed in a unified manner.

[0044] In some embodiments, the relative position is characterized based on the relative relationship of the boundary coordinates of the graphics, and the intersection type of the first graphics and the second graphics is determined according to the relative position of the first graphics and the second graphics, including: Obtaining coordinates of each boundary of the first figure and the second figure; Determine the relative relationship between the coordinates of each boundary of the first figure and the coordinates of each boundary of the second figure; The intersection type corresponding to the relative relationship is obtained as the intersection type between the first graphic and the second graphic.

[0045] In some embodiments, 4 bits are used to represent the positional relationship between the left boundary, right boundary, upper boundary, and lower boundary of the graphics, with the x coordinate of the left boundary being The smaller graphic is used as graphic 1, and the other graphic is used as graphic 2. The specific method is as follows: When , bit3 is 1, otherwise it is 0; When , bit2 is 1, otherwise it is 0; When , bit1 is 1, otherwise it is 0; When , bit0 is 1, otherwise it is 0.

[0046] in, is the x-coordinate of the left edge of the graphic, is the x-coordinate of the right edge of the figure, is the y coordinate of the upper boundary of the graph, is the y coordinate of the lower boundary of the graph. Thus, there are 16 combinations (relative positions) of the above relationship, among which, excluding the combinations where the graphs do not intersect, for example, when bit3 is 0, the only possible combinations are , the figures do not intersect, and there are actually 8 relative positions.

[0047] Figure 4 8 relative positions are illustrated. Figure 4 As shown in (a), the intersection position is represented by 4 bits as "1111", indicating that the first figure and the second figure overlap and have no boundary intersection. Figure 4 As shown in (b), the intersection position is represented by 4 bits as "1110", indicating that the first figure and the second figure intersect and the intersection position is located at the upper boundary of one of the figures. Figure 4 As shown in (c), the intersection position is represented by 4 bits as "1000", indicating that the first figure and the second figure intersect and the intersection position is located at the left edge of one of the figures. Figure 4 As shown in (d), the intersection position is represented by 4 bits as "1101", indicating that the first figure and the second figure intersect and the intersection position is located at the lower boundary of one of the figures. Figure 4 As shown in (e), the intersection position is represented by 4 bits as "1011", indicating that the first figure and the second figure intersect and the intersection position is located at the right edge of one of the figures. Figure 4 As shown in (f), the intersection position is represented by 4 bits as "1100", indicating that the first figure intersects with the second figure, and the two opposite boundaries of one figure intersect with the two opposite boundaries of the other figure. Figure 4 As shown in (g), the intersection position is represented by 4 bits as "1010", indicating that the first figure and the second figure intersect and the intersection position is at the upper left corner and the lower right corner of the figure. Figure 4 As shown in (h), the intersection position is represented by 4 bits as "1001", indicating that the first figure and the second figure intersect and the intersection position is at the upper left corner and the lower right corner of the figures.

[0048] Based on the above-mentioned relative positions, the intersection type may include at least one of edge intersection, area intersection, and angle intersection. Among them, area intersection includes that the first figure overlaps with the second figure and there is no boundary intersection, for example, Figure 4 As shown in (a), the first figure and the second figure overlap and have no border intersection. Edge intersection includes that only one border of the first figure intersects with the second figure or two opposite borders of the first figure intersect with two opposite borders of the second figure, for example, Figure 4As shown in (b) to (e), the first figure and the second figure intersect and the intersection position is located at a boundary of one of the figures, that is, only one boundary of one of the figures intersects with the other figure; for example, Figure 4 As shown in (f), the first figure intersects with the second figure and two opposite boundaries of the first figure intersect with two opposite boundaries of the second figure. Angle intersection includes a vertex of the first figure intersecting with a vertex of the second figure, for example, Figure 4 As shown in (g) and (h), the first figure intersects with the second figure at the vertex corners of the figures, that is, a vertex corner of one figure intersects with a vertex corner of the other figure.

[0049] In some embodiments, according to the intersection type between the first graphic and the second graphic, processing the target intersection graphic to eliminate the overlap between the graphics includes at least one of the following: When the intersection type is area intersection, the smaller figure between the first figure and the second figure is deleted to obtain non-overlapping figures; When the intersection type is edge intersection, the graphics are segmented and deleted according to the intersection boundary to obtain non-overlapping graphics; When the intersection type is an angular intersection, a graphic segmentation process and a graphic deletion process are performed according to the graphic directions of the first graphic and the second graphic and the intersection boundary to obtain non-overlapping graphics.

[0050] Among them, for Figure 4 The intersection type shown in (a) is segmented by deleting the smaller shape, that is, deleting shape 2.

[0051] In some embodiments, when the intersection type is edge intersection, the graphic segmentation and graphic deletion processing is performed according to the intersection boundary, which can reduce the number of processed graphics and make the size of the processed graphics more reasonable. In some embodiments, the graphic segmentation and graphic deletion processing is performed according to the intersection boundary, including: Using the boundary where the first figure intersects with the second figure as a dividing line, dividing the second figure; Delete the portion of the second graphic that is located in the first graphic after segmentation.

[0052] In some embodiments, when only one boundary of a first figure intersects with a second figure, the second figure is segmented using the boundary of the first figure that intersects with the second figure as a dividing line; the portion of the second figure located in the first figure after segmentation is deleted, wherein only one boundary of the first figure intersects with the second figure means that only one boundary line in one figure has an intersection with two opposite boundary lines of another figure, and in this case, the figure with only one boundary intersecting is the first figure, and the other figure is the second figure.

[0053] In some implementations, when two relative boundaries of a first figure intersect with two relative boundaries of a second figure, the two boundaries of the first figure intersecting with the second figure are used as dividing lines to divide the second figure, and the portion of the second figure after the division that is located in the first figure is deleted, wherein the intersection of the two relative boundaries of the first figure and the two relative boundaries of the second figure means that the two relative boundary lines of one figure and the two relative boundary lines of another figure have an intersection point, at which time any one of the intersecting figures can be used as the first figure, and the other figure can be used as the second figure, or the figure with any boundary line located on the top of the figure can be used as the first figure, or the figure with any boundary line located on the left of the figure can be used as the first figure, and the other figure can be used as the second figure, etc. In one embodiment, the figure whose intersecting boundary lines in the intersecting figures are perpendicular to the direction of most of the figures in the current layout is used as the first figure, and the two intersecting boundary lines of the first figure are used as the dividing line to divide the second figure.

[0054] Among them, for Figure 4 In the intersection types shown in (b) to (e), the boundary where the first figure intersects with the second figure is used as the dividing line to divide the second figure, and the part of the second figure that is located in the first figure after the division is deleted. In this case, there is only one boundary where the first figure intersects with the second figure, and therefore there is only one dividing line. Specifically, Figure 4 The intersection position of (b) is located at the upper boundary of one of the figures. The boundary where the lower figure intersects with the upper figure is used as the dividing line to divide the upper figure. Then, the part of the upper figure located in the lower figure is deleted, that is, the part of figure 2 located in figure 1 is deleted. Figure 4 The intersection position of (c) is located at the left boundary of one of the figures. The boundary where the right figure intersects with the left figure is used as the dividing line to divide the left figure. Then, the part of the left figure located in the right figure is deleted, that is, the part of figure 2 located in figure 1 is deleted. Figure 4 The intersection position of (d) is located at the lower boundary of one of the figures. The boundary where the upper figure intersects with the lower figure is used as the dividing line to divide the lower figure. Then, the part of the lower figure located in the upper figure is deleted, that is, the part of figure 2 located in figure 1 is deleted. Figure 4 The intersection position of (e) is located at the right boundary of one of the figures. The boundary where the left figure intersects with the right figure is used as the dividing line to divide the right figure. After that, the part of the right figure located in the left figure is deleted, that is, the part of figure 2 located in figure 1 is deleted.

[0055] In some embodiments, when only one boundary of the first graphic intersects with the second graphic, after deleting the portion of the second graphic that is cut and located in the first graphic, the method further includes: Determine whether the lengths or widths of the processed graphics are consistent; If yes, the processed graphics are merged.

[0056] Among them, for Figure 4 In the relative positions shown in (b) to (e), after deleting the portion of the second figure that is located in the first figure after segmentation, it is further determined whether the lengths or widths of the segmented figures are consistent. If they are consistent, the figures are merged, thereby further reducing the generation of slender figures. Otherwise, no merging is performed and the processed figures are retained.

[0057] Specifically, Figure 4 In the relative position shown in (b), after deleting the part of shape 2 located in shape 1, determine whether the two rectangles obtained by segmentation meet ,in, is the horizontal coordinate of the left border of Figure 1, is the horizontal coordinate of the left border of Figure 2, is the horizontal coordinate of the right border of Figure 1, is the horizontal coordinate of the right border of Figure 2, that is, determine whether the span of the remaining part of Figure 2 and Figure 1 in the x-direction is equal. If so, merge the two rectangles. The merging strategy is to merge them into one rectangle along the y-axis. Figure 4 The relative position shown in (d) is handled in the same way and will not be repeated here.

[0058] Figure 4 In the relative position shown in (c), after deleting the part of shape 1 located in shape 2, determine whether the two rectangles obtained by segmentation meet ,in, is the ordinate of the lower boundary of Figure 1, is the ordinate of the lower boundary of Figure 2, is the ordinate of the upper boundary of Figure 1, is the ordinate of the upper boundary of Figure 2, that is, determine whether the span of the remaining part of Figure 1 and Figure 2 in the y direction is equal. If so, merge the two rectangles. The merging strategy is to merge them into one rectangle along the x-axis. Figure 4 The relative position shown in (e) is handled in the same way and will not be repeated here.

[0059] against Figure 4In the intersection type shown in (f), two opposite boundaries of the first figure intersect with two opposite boundaries of the second figure, and the boundary of the first figure intersecting with the second figure is used as the dividing line to divide the second figure, and the part of the second figure after the division that is located in the first figure is deleted. In this case, there are two boundaries of the first figure intersecting with the second figure, and thus there are two dividing lines. Specifically, the intersection of figure 1 and figure 2 is located at the upper boundary and the lower boundary of figure 1, and Figure 2 In this case, Figure 1 can be divided into three rectangles along the x-axis direction, with the left and right boundaries of Figure 2 as the dividing coordinates, and the part of Figure 1 located inside Figure 2, that is, the part of Figure 1 located in the overlapping area, can be deleted. Figure 2 can also be divided into three rectangles along the y-axis direction, with the upper and lower boundaries of Figure 1 as the dividing coordinates, and the part of Figure 2 located inside Figure 3, that is, the part of Figure 2 located in the overlapping area, can be deleted.

[0060] For the intersection types of angle intersections shown in (g) and (h) in the figure, segmentation processing is performed according to the graphic directions of the first graphic and the second graphic, while ensuring uniform segmentation and further avoiding the appearance of slender graphics.

[0061] Please refer to Figure 2 In the existing processing method, a uniform horizontal or vertical cut is used, which easily leads to the appearance of slender figures in the processed figures. Since the width of the slender figure (the length of the short side of the figure) is quite different from the width of the original design of the figure, 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 result and the electromigration calculation result. Figures 5 to 7 As shown, the appropriate cutting direction can be selected according to the direction of the figure to avoid the appearance of slender figures, thereby further improving the accuracy of circuit analysis.

[0062] In some embodiments, when the intersection type is an angular intersection, the graphic segmentation process and the graphic deletion process are performed according to the graphic directions of the first graphic and the second graphic and the boundary of the intersection, including at least one of the following: When the graphic directions of the first graphic and the second graphic are the same, a graphic segmentation process is performed based on the boundary of the first graphic and the boundary of the second graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle, and then a graphic segmentation process and a graphic deletion process are performed on the intersecting graphic in the graphic obtained by the segmentation process; that is, the boundary of the first graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle is used as a segmentation line to segment the second graphic, and the boundary of the second graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle is used as a segmentation line to segment the first graphic; When the graphic directions of the first graphic and the second graphic are the same or different, the second graphic can be segmented based on the boundary perpendicular to the graphic direction of the second graphic corresponding to the vertex angle of the first graphic, and then the intersecting graphics in the graphics obtained by the segmentation can be segmented and deleted.

[0063] In some embodiments, the graphic segmentation and graphic deletion processing of the intersecting graphics in the graphics obtained by the segmentation processing can refer to the situation when the intersection type is edge intersection and the first graphic has only one boundary that intersects with the second graphic, and the graphic segmentation and graphic deletion processing are performed according to the intersecting boundaries to obtain non-overlapping graphics.

[0064] In some embodiments, when the graphic directions of the first graphic and the second graphic are the same, a graphic segmentation process is performed based on the boundary of the first graphic and the boundary of the second graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle, and then a graphic segmentation process and a graphic deletion process are performed on the intersecting graphics in the graphics obtained by the segmentation process, and the method further includes: The graphics obtained by processing the intersecting graphics are merged.

[0065] Among them, for Figure 4 For the intersection types shown in (g) and (h), when the graphic directions of the first graphic and the second graphic are the same or different, the second graphic can be segmented based on the boundary perpendicular to the graphic direction of the second graphic corresponding to the vertex angle of the first graphic, and then the intersecting graphics in the segmented graphics can be segmented and deleted.

[0066] Specifically, for Figure 4 The relative position shown in (g) is as follows: Figure 5 As shown in the left figure of (a), the boundary where the dotted line of the upper figure is located (that is, the boundary perpendicular to the direction of the figure corresponding to the vertex of the first figure) can be used to perform a figure segmentation process on the lower figure, and a figure located on the left side of the dotted line and two intersecting figures located on the right side of the dotted line are obtained. The two intersecting figures on the right side of the dotted line are the intersecting figures in the figure obtained by the segmentation process. Then, the intersecting figures in the figure obtained by the segmentation process are subjected to a figure segmentation process and a figure deletion process (the processing method in which only one boundary of the first figure intersects with the second figure in the reference edge intersection) is finally obtained. Figure 5 The three non-overlapping rectangles shown in the right figure of (a) are shown in the figure. Of course, the upper figure can also be segmented using the border perpendicular to the direction of the figure corresponding to the vertex of the lower figure, and then the intersecting figures in the segmented figure can be segmented and deleted. The same three non-overlapping rectangles can be obtained, which will not be repeated. Figure 5Taking the intersecting figures shown in (a) as an example, the processing method of the first figure in the reference edge intersection where only one boundary intersects with the second figure is used to perform figure segmentation and figure deletion on the intersecting figures in the figure obtained by the segmentation process. The specific process is: use the boundary of the figure located above in the intersecting figure on the right side of the dotted line as the segmentation line, segment the figure located below in the intersecting figure on the right side of the dotted line, and then delete the part of the figure below that is located in the figure above, so that the intersecting figure on the right side of the dotted line can be processed into two non-overlapping figures.

[0067] like Figure 5 As shown in the left figure in (b), the boundary where the dotted line of the upper figure is located (that is, the boundary perpendicular to the direction of the figure corresponding to the vertex of the first figure) can be used to perform a figure segmentation process on the lower figure, and a figure located below the dotted line and two intersecting figures located above the dotted line are obtained. The two intersecting figures above the dotted line are the intersecting figures in the figure obtained by the segmentation process. Then, the intersecting figures in the figure obtained by the segmentation process are subjected to a figure segmentation process and a figure deletion process (the processing method in which only one boundary of the first figure intersects with the second figure in the reference edge intersection) is finally obtained. Figure 5 The three non-overlapping rectangles shown in the right figure of (b) are shown in the figure. Of course, the upper figure can also be segmented using the border perpendicular to the direction of the figure corresponding to the vertex of the lower figure, and then the intersecting figures in the segmented figure can be segmented and deleted, and three non-overlapping rectangles can also be obtained, which will not be repeated.

[0068] like Figure 5 As shown in the left figure in (c), the boundary where the dotted line of the lower figure is located (that is, the boundary perpendicular to the figure direction of the second figure corresponding to the vertex of the first figure) can be used to perform a figure segmentation process on the upper figure, and a figure located on the right side of the dotted line and two intersecting figures located on the left side of the dotted line are obtained. The two intersecting figures on the left side of the dotted line are the intersecting figures in the figure obtained by the segmentation process. Then, the intersecting figures in the figure obtained by the segmentation process are subjected to a figure segmentation process and a figure deletion process (the processing method in which only one boundary of the first figure intersects with the second figure in the reference edge intersection) to finally obtain Figure 5 The three non-overlapping rectangles shown in the right figure of (c) are shown in the figure. Of course, the boundary of the upper figure can also be used to segment the lower figure, and then the intersecting figures in the segmented figure can be segmented and deleted, and three non-overlapping rectangles can also be obtained, which will not be repeated here.

[0069] Figure 5As shown in (d), the upper figure can be segmented using the boundary where the dotted line of the lower figure is located, and a figure located above the dotted line and two intersecting figures located below the dotted line are obtained. The two intersecting figures below the dotted line are the intersecting figures in the figure obtained by the segmentation process. Then, the intersecting figures in the figure obtained by the segmentation process are segmented and deleted (with reference to the processing method in which only one boundary of the first figure intersects with the second figure in the edge intersection), and finally obtained Figure 5 The three non-overlapping rectangles shown in the right figure of (d) are shown in the figure. Of course, the boundary of the upper figure can also be used to segment the lower figure, and then the intersecting figures in the segmented figure can be segmented and deleted, and three non-overlapping rectangles can also be obtained, which will not be repeated here.

[0070] against Figure 4 The relative position shown in (h) is Figure 7 As shown in (c), the left longitudinal boundary of the lower figure can be used to perform a graphic segmentation process on the upper figure, and then the intersecting figures in the segmentation process can be segmented and deleted (refer to the processing method in which only one boundary of the first figure intersects with the second figure in the edge intersection), and finally three non-overlapping rectangles can be obtained. Of course, the lower horizontal boundary of the upper figure can also be used to perform a graphic segmentation process on the lower figure, and then the intersecting figures in the segmentation process can be segmented and deleted, and three non-overlapping rectangles can also be obtained, which will not be repeated.

[0071] Figure 7 As shown in (d), the upper horizontal boundary of the lower figure can be used to perform a graphic segmentation process on the upper figure, and then the intersecting figures in the segmentation process can be segmented and deleted (refer to the processing method in which only one boundary of the first figure intersects with the second figure in the edge intersection), and finally three non-overlapping rectangles can be obtained. Of course, the right vertical boundary of the upper figure can also be used to perform a graphic segmentation process on the lower figure, and then the intersecting figures in the segmentation process can be segmented and deleted, and three non-overlapping rectangles can also be obtained, which will not be repeated.

[0072] In some embodiments, Figure 4 The intersection types shown in (g) and (h) can also be processed separately according to the graphic directions of the two graphics. There are three cases in total: the intersection of horizontal graphics and horizontal graphics, the intersection of vertical graphics and vertical graphics, and the intersection of horizontal graphics and vertical graphics.

[0073] When the graphic directions of the first graphic and the second graphic are the same, that is, when horizontal graphics intersect with horizontal graphics and when vertical graphics intersect with vertical graphics, the graphic segmentation process is performed based on the boundary of the first graphic and the boundary of the second graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle, and then the intersecting graphics in the graphics obtained by the segmentation process are segmented and deleted. In this case, the boundary of the first graphic and the boundary of the second graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle are used as the segmentation lines, and there will be two segmentation lines, the size distribution of the segmented graphics is more balanced, and the way of connecting the graphics (the graphics are in contact with each other but not overlapping) is also simpler.

[0074] Among them, when the horizontal graphics intersect with the horizontal graphics, Figure 4 The relative position shown in (g) is as follows: Figure 6 As shown in the left figure in (a), when two horizontal figures intersect, the figure segmentation process is performed at the boundary where the dotted line is located (vertical boundary), and a figure located on the left side of the left dotted line, a figure located on the right side of the right dotted line, and two intersecting figures located between the two dotted lines are obtained. The two intersecting figures between the two dotted lines are the intersecting figures in the figure obtained by the segmentation process. Then, the intersecting figures in the figure obtained by the segmentation process are subjected to figure segmentation processing, figure deletion processing, and figure merging processing (the processing method of the first figure having only one boundary intersecting with the second figure in the reference edge intersection) to finally obtain Figure 6 The three rectangles shown in the right figure in (a); Figure 4 The relative position shown in (h) is as follows: Figure 7 As shown in (a), when two horizontal figures intersect, the figure is segmented using the vertical boundary, and then the intersecting figures in the segmented figures are segmented, deleted, and merged (the processing method in which only one boundary of the first figure intersects with the second figure in the reference edge intersection) to finally obtain three rectangles.

[0075] When a vertical graph intersects with a vertical graph, Figure 4 The relative position shown in (g) is as follows: Figure 6 As shown in the left figure in (b), when two longitudinal figures intersect, they are segmented at the boundary where the dotted line is located (horizontal boundary), and a figure located above the upper dotted line, a figure located below the lower dotted line, and two intersecting figures located between the two dotted lines are obtained. The two intersecting figures between the two dotted lines are the intersecting figures in the figures obtained by the segmentation process. Then, the intersecting figures in the figures obtained by the segmentation process are segmented, deleted, and merged (with reference to the processing method in which only one boundary of the first figure intersects with the second figure in the edge intersection), and finally obtained Figure 6 The three rectangles shown in the right figure in (b); Figure 4 The relative position shown in (h) is as follows: Figure 7 As shown in (b), when two vertical figures intersect, they are segmented using the horizontal boundary, and then the intersecting figures in the figures obtained by the segmentation are segmented, deleted, and merged (the processing method in which only one boundary of the first figure intersects with the second figure in the reference edge intersection) to finally obtain three rectangles.

[0076] When a horizontal figure and a vertical figure intersect, that is, two figures in different directions intersect, the second figure is segmented based on the boundary perpendicular to the figure direction corresponding to the vertex of the first figure, and then the intersecting figures in the segmented figure are segmented and deleted. This processing process is similar to Figure 5 (c) and (d) are the same and will not be described again.

[0077] In this way, the grid direction is no longer used as a reference during processing, ensuring that the same intersecting graphic structure has a unified processing method in different grids, thereby improving the accuracy of circuit analysis. At the same time, the appropriate segmentation direction can be selected according to the direction of the graphic to avoid the appearance of thin strips of graphics, thereby further improving the accuracy of circuit analysis.

[0078] Figure 8 FIG. 1 is a schematic diagram of a structure of a device for processing intersecting graphics in a chip layout according to an embodiment. Figure 8 As shown, the device for processing intersecting graphics in the chip layout of the present application includes: The intersection graph determination module 701 is used to determine a target intersection graph in the chip layout graph, where the target intersection graph includes an intersecting first graph and a second graph; The processing module 702 is used to process the target intersecting graphics according to the relative position of the first graphics and the second graphics to obtain non-overlapping graphics, and the processing includes at least one of only performing graphics deletion processing, performing graphics segmentation processing and graphics deletion processing in sequence.

[0079] In some embodiments, the target intersection graph in the chip layout graph is determined, and the intersection graph determination module 701 is used to: Obtaining a set of intersecting graphics to be processed, where the set of intersecting graphics includes two or more graphics; Get the number of overlapping areas in the intersecting graphics set; If the number of overlapping regions is greater than one, the target overlapping region is determined according to the position of the overlapping regions; The two intersecting figures corresponding to the target overlapping area are taken as the target intersecting figures.

[0080] In some embodiments, the intersection graph set to be processed is obtained, and the intersection graph determination module 701 is used for at least one of the following: Obtaining graphic overlap information, and determining a set of intersecting graphics according to the graphic overlap information; According to the overlapping relationship between the processed graphics and the graphics to be processed in the intersecting graphics set, the graphics overlapping information is updated, and the intersecting graphics set is determined according to the updated graphics overlapping information.

[0081] In some embodiments, processing the target intersecting graphics to obtain non-overlapping graphics according to the relative positions of the first graphics and the second graphics includes: Determining the intersection type between the first figure and the second figure according to the relative position of the first figure and the second figure; According to the processing method corresponding to the intersection type of the first graphic and the second graphic, the target intersection graphic is processed to obtain non-overlapping graphics.

[0082] In some embodiments, the relative position is characterized based on the relative relationship of the boundary coordinates of the graphics, and the intersection type of the first graphics and the second graphics is determined according to the relative position of the first graphics and the second graphics. The processing module 702 is used to: Obtaining coordinates of each boundary of the first figure and the second figure; Determine the relative relationship between the coordinates of each boundary of the first figure and the coordinates of each boundary of the second figure; The intersection type corresponding to the relative relationship is obtained as the intersection type between the first graphic and the second graphic.

[0083] In some embodiments, the intersection type includes at least one of edge intersection, area intersection, and angle intersection; The area intersection includes the first figure overlapping with the second figure and intersecting without a boundary; The edge intersection includes that only one boundary of the first figure intersects with the second figure or two opposite boundaries of the first figure intersect with two opposite boundaries of the second figure; The angle intersection includes a vertex angle of the first figure intersecting with a vertex angle of the second figure.

[0084] In some embodiments, the target intersection graphic is processed according to the intersection type between the first graphic and the second graphic, and the processing module 702 is used for at least one of the following: When the intersection type is area intersection, the smaller figure between the first figure and the second figure is deleted to obtain non-overlapping figures; When the intersection type is edge intersection, a graphic segmentation process and a graphic deletion process are performed according to the boundary where the first graphic and the second graphic intersect, so as to obtain graphics that do not overlap each other; When the intersection type is an angular intersection, a graphic segmentation process and a graphic deletion process are performed according to the graphic directions of the first graphic and the second graphic and the intersection boundary to obtain non-overlapping graphics.

[0085] In some embodiments, the processing module 702 is used to perform the graphic segmentation and graphic deletion processing according to the boundary where the first graphic and the second graphic intersect: Using the boundary where the first figure intersects with the second figure as a dividing line, dividing the second figure; Delete the portion of the second graphic that is located in the first graphic after segmentation.

[0086] In some embodiments, a merging module is also included, which is used to, when only one boundary of the first graphic intersects with the second graphic, delete the portion of the second graphic that is located in the first graphic after being cut, and then determine whether the lengths or widths of the processed graphics are consistent; if so, merge the processed graphics.

[0087] In some embodiments, when the intersection type is an angular intersection, a graphic segmentation process and a graphic deletion process are performed according to the graphic directions of the first graphic and the second graphic and the boundary of the intersection, and the processing module 702 is used to perform at least one of the following: When the graphic directions of the first graphic and the second graphic are the same, a graphic segmentation process is performed based on the boundary of the first graphic and the boundary of the second graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle, and then a graphic segmentation process and a graphic deletion process are performed on the intersecting graphics in the graphics obtained by the segmentation process; When the graphic directions of the first graphic are the same or different from those of the second graphic, the second graphic is segmented based on the boundary perpendicular to the graphic direction of the second graphic corresponding to the vertex angle of the first graphic, and then the intersecting graphics in the graphics obtained by the segmentation are segmented and deleted.

[0088] In some embodiments, the device also includes a merging module, which is used to perform a graphic segmentation process on the boundary of the first graphic and the boundary of the second graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle when the graphic directions of the first graphic and the second graphic are the same, and then perform a graphic segmentation process and a graphic deletion process on the intersecting graphics in the graphics obtained by the segmentation process, and then merge the graphics obtained by the processing of the intersecting graphics.

[0089] In the device for processing intersecting graphics in a chip layout, the specific implementation process of the steps executed by each module can be found in the description of the method embodiment, which will not be repeated here.

[0090] The present application also provides an electronic device, including a storage medium and a controller, characterized in that a computer program is stored on the storage medium, and when the computer program is executed by the controller, the steps of the method for processing intersecting graphics in the chip layout as described in the above embodiment are implemented.

[0091] The present application also provides a storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of the method for processing intersecting graphics in a chip layout as described in the above embodiment are implemented.

[0092] The method, device, and electronic device for processing intersecting graphics in the chip layout of the present application include: determining a target intersecting graphic, the target intersecting graphic includes a first graphic and a second graphic; processing the target intersecting graphic according to the relative position of the first graphic and the second graphic to obtain a non-overlapping graphic, the processing includes only performing graphic deletion processing, performing graphic segmentation processing in sequence, and performing at least one of graphic deletion processing. The technical solution of the present application processes the intersecting graphics based on the relative position, ensuring that the same intersecting graphic structure has a unified processing method in different grids to improve the accuracy of circuit analysis.

[0093] 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 method for processing intersecting graphics in a chip layout, characterized in that: The method comprises the following steps: Determine a target intersection figure in the chip layout figure, wherein the target intersection figure includes an intersecting first figure and a second figure; According to the relative position of the first graphic and the second graphic, the target intersecting graphic is processed to obtain a non-overlapping graphic, and the processing includes at least one of only performing graphic deletion processing, performing graphic segmentation processing and graphic deletion processing in sequence.

2. The method according to claim 1, characterized in that The step of determining a target intersection graph in a chip layout graph includes: Obtaining a current set of intersecting graphics to be processed, wherein the set of intersecting graphics includes two or more graphics; Obtaining the number of overlapping areas in the set of intersecting graphics; If the number of the overlapping regions is greater than one, determining a target overlapping region according to the positions of the overlapping regions; The two intersecting graphs corresponding to the target overlapping area are used as the target intersecting graphs.

3. The method according to claim 2, characterized in that The step of obtaining the set of intersecting graphics to be processed currently includes at least one of the following: Acquire graphic overlap information, and determine the set of intersecting graphics according to the graphic overlap information; The graphic overlap information is updated according to the overlapping relationship between the graphics that have completed the processing and the graphics to be processed in the intersecting graphic set to which they belong, and the intersecting graphic set is determined according to the updated graphic overlap information.

4. The method according to claim 1, characterized in that: The step of processing the target intersecting graphics to obtain non-overlapping graphics according to the relative positions of the first graphics and the second graphics includes: Determining the intersection type between the first graphic and the second graphic according to the relative position of the first graphic and the second graphic; According to a processing method corresponding to the intersection type of the first graphic and the second graphic, the target intersection graphic is processed to obtain non-overlapping graphics.

5. The method according to claim 4, characterized in that The relative position is characterized based on the relative relationship of the boundary coordinates of the graphics, and the determining the intersection type of the first graphics and the second graphics according to the relative position of the first graphics and the second graphics includes: Obtaining coordinates of each boundary of the first figure and the second figure; Determining a relative relationship between coordinates of each boundary of the first figure and coordinates of each boundary of the second figure; An intersection type corresponding to the relative relationship is acquired as the intersection type between the first graphic and the second graphic.

6. The method according to claim 4, characterized in that The intersection type includes at least one of edge intersection, area intersection, and angle intersection; The area intersection includes the first figure and the second figure overlapping and intersecting without a boundary; The edge intersection includes that only one boundary of the first figure intersects with the second figure or two opposite boundaries of the first figure intersect with two opposite boundaries of the second figure; The angle intersection includes a vertex angle of the first figure intersecting with a vertex angle of the second figure.

7. The method according to claim 6, characterized in that The processing of the target intersection graphic to eliminate the overlap between the graphics according to the intersection type between the first graphic and the second graphic comprises at least one of the following: When the intersection type is area intersection, deleting the smaller figure between the first figure and the second figure to obtain non-overlapping figures; When the intersection type is edge intersection, performing a graphic segmentation process and a graphic deletion process according to the boundary where the first graphic and the second graphic intersect, so as to obtain non-overlapping graphics; When the intersection type is an angular intersection, a graphic segmentation process and a graphic deletion process are performed according to the graphic directions of the first graphic and the second graphic and the intersecting boundary to obtain non-overlapping graphics.

8. The method according to claim 7, characterized in that The step of performing a graphic segmentation process and a graphic deletion process according to a boundary where the first graphic and the second graphic intersect, comprises: Using the boundary where the first figure intersects with the second figure as a dividing line, dividing the second figure; The portion of the second graphic that is segmented and located in the first graphic is deleted.

9. The method according to claim 8, characterized in that When only one boundary of the first figure intersects with the second figure, after deleting the portion of the second figure that is segmented and located in the first figure, the method further includes: Determine whether the lengths or widths of the processed graphics are consistent; If yes, the processed graphics are merged.

10. The method according to claim 7, characterized in that When the intersection type is an angular intersection, the graphic segmentation processing and graphic deletion processing according to the graphic directions and the intersecting boundaries of the first graphic and the second graphic include at least one of the following: When the graphic directions of the first graphic and the second graphic are the same, a graphic segmentation process is performed based on the boundary of the first graphic and the boundary of the second graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle, and then a graphic segmentation process and a graphic deletion process are performed on the intersecting graphics in the graphics obtained by the segmentation process; When the graphic directions of the first graphic are the same or different from those of the second graphic, the second graphic is segmented based on the boundary perpendicular to the graphic direction of the second graphic corresponding to the vertex angle of the first graphic, and then the intersecting graphics in the graphics obtained by the segmentation are segmented and deleted.

11. The method according to claim 10, characterized in that When the graphic directions of the first graphic and the second graphic are the same, a graphic segmentation process is performed based on the boundary of the first graphic and the boundary of the second graphic perpendicular to the graphic direction corresponding to the intersecting vertex angle, and then a graphic segmentation process and a graphic deletion process are performed on the intersecting graphics in the graphics obtained by the segmentation process, the method further includes: The graphics obtained by processing the intersecting graphics are merged.

12. A device for processing intersecting graphics in a chip layout, characterized in that: The device comprises: An intersection graph determination module, used to determine a target intersection graph in a chip layout graph, wherein the target intersection graph includes an intersecting first graph and a second graph; A processing module is used to process the target intersecting graphics according to the relative position of the first graphics and the second graphics to obtain non-overlapping graphics, wherein the processing includes at least one of only performing graphics deletion processing, performing graphics segmentation processing and graphics deletion processing in sequence.

13. 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 method for processing intersecting graphics in a chip layout according to any one of claims 1 to 11 are implemented.

14. 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 method for processing intersecting graphics in a chip layout according to any one of claims 1 to 11 are implemented.