Method and device for realizing redundant graph filling

Abstract

The invention discloses a method and device for realizing redundant graph filling, and the method comprises the steps: carrying out the inward contraction of a to-be-filled region according to the size of a redundant graph, and converting the inclusion relation judgment of an array unit and the region into the inclusion relation judgment of a dot array and the region. For a scene with a large number of filled graphs and a large filling area, the processing efficiency is greatly improved. Furthermore, through coordinate transformation, the relationship between the redundant graph and the new to-be-filled area is simplified, and complex calculation in the rotating coordinate is avoided, so that the calculation complexity is greatly reduced.

Description

Technical Field

[0001] The present application relates to but is not limited to semiconductor integrated circuit technology, and in particular to a method and device for implementing redundant pattern filling. Background Art

[0002] In chip layout design, filling redundant graphics is an important step to meet process density requirements. During chip manufacturing, uneven layout density may cause etching or deposition process problems. Therefore, it is necessary to fill redundant graphics in the blank areas of the layout to balance the density. When designing a chip, the user will specify the filling area that needs to be filled, and fill the filling area with redundant graphics of a specific style (such as rectangles, circles or other patterns) according to the rules. The filling method is usually to arrange the redundant graphics in a regular array. Each unit in the array corresponds to a possible filling position, and how to judge whether the array unit is included in the filling area is a key issue.

[0003] In order to determine whether each array unit is in the user-specified filling area, a scan line algorithm can be used to determine. The traditional scan line method of determining the inclusion relationship is suitable for general inclusion relationship determination, but it is not efficient for determining whether each unit of the redundant pattern array is completely contained in the area to be filled when there are a large number of filling patterns, a large filling area, or an oblique offset. Summary of the invention

[0004] The present application provides a method and device for implementing redundant graphic filling, which can greatly improve processing efficiency.

[0005] An embodiment of the present invention provides a method for implementing redundant graphic filling, comprising: The area to be filled is shrunk inward according to the size of the redundant pattern to obtain a new area to be filled; It is determined whether the points of the redundant graphics corresponding to the inward contraction are within the new area to be filled.

[0006] In an exemplary embodiment, the step of determining whether the point of the redundant graphic corresponding to the inward contraction is within the new area to be filled includes: If the point of the redundant graphic corresponding to the inward contraction falls within the new area to be filled, it is determined that the redundant graphic where the point is located can be filled; if the point of the redundant graphic corresponding to the inward contraction is not within the new area to be filled, the redundant graphic where the point is located does not need to be considered.

[0007] In one exemplary embodiment, the inward contraction includes: The width of the redundant graphic enclosing outline is shrunk to the left, and the height of the redundant graphic enclosing outline is shrunk downward; the point of the redundant graphic corresponding to the inward contraction is the lower left corner point of the minimum enclosing rectangle of the redundant graphic; or, The width of the redundant graphic enclosing outline is shrunk to the right, and the height of the redundant graphic enclosing outline is shrunk downward; the point of the redundant graphic corresponding to the inward contraction is the lower right corner point of the minimum enclosing rectangle of the redundant graphic; or, The width of the redundant graphic enclosing outline is shrunk to the right, and the height of the redundant graphic enclosing outline is shrunk upward; the point of the redundant graphic corresponding to the inward contraction is the upper right corner point of the minimum enclosing rectangle of the redundant graphic; or, The width of the redundant graphic enclosing outline is shrunk to the left, and the height of the redundant graphic enclosing outline is shrunk upward; the point of the redundant graphic corresponding to the inward contraction is the upper left corner point of the minimum enclosing rectangle of the redundant graphic.

[0008] In an exemplary embodiment, the step of determining whether the point of the redundant graphic corresponding to the inward contraction is within the new area to be filled further includes: By coordinate transformation, the point array consisting of the points of the redundant graphics corresponding to the inward contraction is mapped into a standard coordinate system; wherein the standard coordinate system is a grid aligned in the horizontal and vertical directions.

[0009] In an exemplary embodiment, the step of determining whether the point of the redundant graphic corresponding to the inward contraction is within the new area to be filled includes: Scanning vertical coordinate values ​​of points corresponding to inward contraction of all redundant patterns in the dot array in the vertical direction; Determine whether each vertical coordinate value falls within the range of the new area to be filled, and determine the redundant graphics corresponding to the points with vertical coordinate values ​​that fall within the new area to be filled as redundant graphics that can be filled, and the redundant graphics corresponding to the points with vertical coordinate values ​​that do not fall within the new area to be filled do not need to be considered.

[0010] An embodiment of the present application further provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are used to execute any of the above-described methods for implementing redundant graphic filling.

[0011] An embodiment of the present application further provides a computer device, including a memory and a processor, wherein the memory stores the following instructions executable by the processor: for executing the steps of any of the above-mentioned methods for implementing redundant graphic filling.

[0012] The embodiment of the present application further provides a device for implementing redundant graphic filling, comprising: a preprocessing module and a judgment module; wherein: A preprocessing module, used for shrinking the area to be filled inward according to the size of the redundant graphics to obtain a new area to be filled; The judging module is used to judge whether the point of the redundant figure corresponding to the inward contraction is within the new area to be filled.

[0013] In an exemplary embodiment, the method further includes: a coordinate transformation module, configured to: By coordinate transformation, the point array consisting of the points of the redundant graphics corresponding to the inward contraction is mapped into a standard coordinate system; wherein the standard coordinate system is a grid aligned in the horizontal and vertical directions.

[0014] In an exemplary embodiment, the determination module is used to: Scanning vertical coordinate values ​​of points corresponding to inward contraction of all redundant patterns in the dot array in the vertical direction; Determine whether each vertical coordinate value falls within the range of the new area to be filled, and determine the redundant graphics corresponding to the points with vertical coordinate values ​​that fall within the new area to be filled as redundant graphics that can be filled, and the redundant graphics corresponding to the points with vertical coordinate values ​​that do not fall within the new area to be filled do not need to be considered.

[0015] Other features and advantages of the present invention will be described in the following description, and partly become apparent from the description, or understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained by the structures particularly pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] The accompanying drawings are used to provide further understanding of the technical solution of the present application and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the technical solution of the present application and do not constitute a limitation on the technical solution of the present application.

[0017] Figure 1 A flowchart of a method for implementing redundant graphic filling in an embodiment of the present application; Figure 2 A schematic diagram of the relationship between the area to be filled and the redundant graphics in the embodiment of the present application; Figure 3 This is a schematic diagram of the area to be filled shrinking inwards in an embodiment of the present application; Figure 4 A schematic diagram of the relationship between the new area to be filled after inward contraction and the points of the redundant pattern corresponding to the inward contraction in the embodiment of the present application; Figure 5 A schematic diagram of the relationship between the new area to be filled after the inward contraction after coordinate transformation and the points of the redundant graphics corresponding to the inward contraction in the embodiment of the present application; Figure 6Schematic diagram of the structure of the device for implementing redundant graphic filling in the embodiment of the present application. DETAILED DESCRIPTION

[0018] In order to make the purpose, technical solution and advantages of the present application more clear, the embodiments of the present application will be described in detail below with reference to the accompanying drawings. It should be noted that the embodiments and features in the embodiments of the present application can be combined with each other arbitrarily without conflict.

[0019] In a typical configuration of the present application, a computing device includes one or more processors (CPU), an input / output interface, a network interface, and a memory.

[0020] Memory may include non-permanent storage in a computer-readable medium, in the form of random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of a computer-readable medium.

[0021] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include non-transitory media such as modulated data signals and carrier waves.

[0022] The steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions. Also, although a logical sequence is shown in the flowchart, in some cases, the steps shown or described can be performed in a sequence different from that shown here.

[0023] The scanning line algorithm is an algorithm based on two-dimensional plane geometry, which generally includes: Decompose the polygons that make up the fill area and sort out all the boundary segments; start from the lowest y coordinate of the fill area and gradually move the scan line upwards. Each time the scan line moves, check the intersection of the current scan line and the boundary of the fill area; Store the borders currently crossed by the scan line into the Active Edge Table (AET). The edges in the AET are sorted by x-coordinate to mark which areas are inside the fill area. For each array cell, check whether its center point or boundary point falls within the filling area marked by the current scan line. If the y coordinate of the point is within the current scan line range and the x coordinate of the point is within the filling interval marked by AET, the cell is included; if the point does not meet the conditions, it is not filled; The scan line moves up by one step size (usually the height of the redundant graphics unit), updates the AET, removes edges that no longer cross and adds new crossing edges, and continues scanning until the highest y coordinate is reached.

[0024] For scenes with a large number of fill graphics, the traditional scan line algorithm will determine whether each fill unit is in the fill area one by one, resulting in a large number of repeated calculations. When the number of redundant graphic units in the fill area is extremely large (such as millions or even more), even if the single judgment efficiency is high, the overall time consumption will accumulate quickly. In other words, as the number of fill graphics increases, the computational complexity increases linearly or more, which is inefficient.

[0025] For scenes with very large fill areas, in traditional scan line algorithms, the scan lines need to cover the entire fill area. Even if only part of the fill area has actual content, the algorithm still needs to process the boundaries of the entire area, resulting in redundant calculations. When the fill area contains a large number of polygons or a large range of boundary lines, the management complexity of AET increases significantly, especially when multiple levels of regions are nested. In other words, the scan line algorithm needs to completely scan the entire fill area, resulting in most of the calculations being used in invalid areas, wasting resources.

[0026] For scenes with oblique offsets, traditional algorithms usually assume that redundant graphics are aligned in a regular grid, but in actual design, redundant graphics may need to be arranged obliquely (such as diagonally). For redundant graphics with oblique offsets, judging whether their center points or boundaries are in the fill area involves complex geometric operations, such as rotation, transformation, or floating-point calculations. In other words, oblique offsets increase the complexity of judgment and reduce the efficiency of traditional algorithms, especially when floating-point operations or complex geometric operations are not optimized enough.

[0027] The traditional scan line algorithm is a general algorithm, which was not originally designed for the scenario of redundant graphics filling. On the one hand, due to its indiscriminate scanning, the scan of the filling area is fully covered and irrelevant areas cannot be skipped; on the other hand, it does not make full use of the rules of redundant graphics (such as regular arrangement) for optimization and there are repeated judgments; furthermore, it cannot directly adapt to oblique arrangements, and additional geometric calculations increase the amount of calculation.

[0028] In order to better apply to the scenario of redundant graphic filling, the embodiment of the present application provides a method for implementing redundant graphic filling, such as Figure 1 As shown, it may include: Step 100: shrink the area to be filled inward according to the size of the redundant pattern to obtain a new area to be filled.

[0029] In the embodiment of the present application, shrinking means shrinking the area to be filled inward according to the size of the redundant pattern to obtain a new smaller area to be filled. After this processing, the complex pattern inclusion judgment is transformed into a simple question of whether the point falls within the area, that is, the inclusion relationship judgment between the array unit and the area is transformed into the inclusion relationship judgment between the point array and the area, which clarifies the judgment rules and simplifies the calculation.

[0030] like Figure 2 As shown, the area to be filled 21 represents the range within which the redundant pattern 22 is allowed to be filled, and the shrinking operation is to adjust the boundary of the area to be filled 21 .

[0031] In one embodiment, the shrinking may include: shrinking the width (W) of the outline surrounded by the redundant pattern 22 to the left, and shrinking the height (H) of the outline surrounded by the redundant pattern 22 downward, such as Figure 3 As shown, a new area to be filled 211 is obtained. In this way, the whole problem is simplified to Figure 4 The point array shown is included in the problem of the new area to be filled 211. At this time, the point of the redundant figure corresponding to the inward contraction is the lower left corner point of the minimum enclosing rectangle of the redundant figure 22, and the point array is composed of the lower left corner point 221 of the minimum enclosing rectangle of the redundant figure 22.

[0032] In one embodiment, the contraction may include: contracting the width of the outline surrounding the redundant pattern 22 to the right, and contracting the height of the outline surrounding the redundant pattern 22 downward, to obtain a new area to be filled. In this way, the entire problem is simplified to the problem of the point array being included in the new area to be filled. At this time, the point of the redundant pattern corresponding to the inward contraction is the lower right corner point of the minimum enclosing rectangle of the redundant pattern 22, and the point array is composed of the lower right corner point of the minimum enclosing rectangle of the redundant pattern 22.

[0033] In one embodiment, the shrinking may include: shrinking the width of the outline surrounding the redundant pattern 22 to the right, shrinking the height of the outline surrounding the redundant pattern 22 upward, and obtaining a new area to be filled. In this way, the entire problem is simplified to the problem of the point array being included in the new area to be filled. At this time, the point of the redundant pattern corresponding to the inward shrinkage is the upper right corner point of the minimum enclosing rectangle of the redundant pattern 22, and the point array is composed of the upper right corner point of the minimum enclosing rectangle of the redundant pattern 22.

[0034] In one embodiment, the contraction may include: contracting the width of the outline surrounding the redundant pattern 22 to the left, and contracting the height of the outline surrounding the redundant pattern 22 upward, to obtain a new area to be filled. In this way, the entire problem is simplified to the problem of the point array being included in the new area to be filled. At this time, the point of the redundant pattern corresponding to the inward contraction is the upper left corner point of the minimum enclosing rectangle of the redundant pattern 22, and the point array is composed of the upper left corner point of the minimum enclosing rectangle of the redundant pattern 22.

[0035] In one embodiment, the contraction may include: contracting the redundant graphic 22 to the left by half the width (W / 2), contracting the redundant graphic to the top by half the height (H / 2), contracting the redundant graphic to the right by half the width (W / 2), contracting the redundant graphic to the bottom by half the height (H / 2), and obtaining a new area to be filled. In this way, the whole problem is simplified to the problem of the point array being included in the new area to be filled, and at this time, the point of the redundant graphic corresponding to the inward contraction is the center point of the minimum enclosing rectangle of the redundant graphic 22, and the point array is composed of the center point of the minimum enclosing rectangle of the redundant graphic 22.

[0036] The above shrinking implementation is only an example and is not intended to limit the protection scope of the present application, as long as the inclusion relationship judgment between the array unit and the region can be converted into the inclusion relationship judgment between the point array and the region.

[0037] Step 102: Determine whether the point of the redundant pattern corresponding to the inward contraction is within the new area to be filled.

[0038] In one exemplary embodiment, step 102 may include: If the point of the redundant figure corresponding to the inward contraction falls within the new area to be filled, it is directly determined that the redundant figure where the point is located can be filled; if the point of the redundant figure corresponding to the inward contraction is not in the new area to be filled, there is no need to consider the redundant figure where the point is located.

[0039] The process of shrinking the area to be filled inward according to the size of the redundant graphics in the embodiment of the present application is actually an operation on the area to be filled. Based on the size of the redundant graphics, the boundary of the original area to be filled is translated inward, and the inclusion relationship judgment between the array unit and the area is converted into the inclusion relationship judgment between the point array and the area. In this way, the processing efficiency is greatly improved for scenes with a large number of filling graphics and a large filling area.

[0040] Redundant graphics may be arranged along a certain diagonal direction (such as Figure 4 As shown in the figure, since the relationship between the fill area and the redundant graphics corresponding to the inward contraction points needs to consider the rotation angle, in the case of an oblique arrangement, calculating whether the graphics are included requires complex geometric operations (such as rotation, slope calculation, etc.). Therefore, the oblique arrangement increases the complexity of the judgment.

[0041] In an exemplary embodiment, before step 102, the following steps may also be included: Step 101: Mapping the point array consisting of points of the redundant graphics corresponding to inward contraction into a standard coordinate system through coordinate transformation, where the standard coordinate system is a grid aligned in horizontal and vertical directions.

[0042] Through coordinate transformation, the relationship between redundant graphics and new areas to be filled is simplified, the problem is converted into a standard straight line arrangement, the judgment logic is simplified, and complex calculations in rotating coordinates are avoided, thereby greatly reducing the calculation complexity.

[0043] In one embodiment, if Figure 4 As shown, assuming that the angle between the arrangement direction of the point array of the redundant figure corresponding to the inward contraction and the horizontal coordinate system is θ, then the entire coordinate system (including the new area to be filled and the point array of the redundant figure corresponding to the inward contraction) can be rotated by an angle of -θ, as shown in Figure 5 As shown, the obliquely arranged point array is aligned with the horizontal and vertical directions after transformation.

[0044] In one exemplary embodiment, step 102 may include: Scan in the vertical direction, i.e., the y direction Figure 5 The vertical coordinate values ​​of the points corresponding to the inward contraction of all redundant graphics in the point array shown, i.e., the y values, that is, traverse each y value in the point array (the points corresponding to the inward contraction of the redundant graphics); Determine whether each y value falls within the range of the new area to be filled, and determine the redundant graphics corresponding to the points of the y value that fall within the new area to be filled as the redundant graphics that can be filled; the redundant graphics corresponding to the points of the y value that do not fall within the new area to be filled do not need to be considered.

[0045] In the embodiment of the present application, the oblique offset is eliminated through coordinate transformation. Therefore, only one scan is required in the y direction, and there is no need to sort each y value. The special circumstances of the problem are fully utilized to achieve a simplification effect.

[0046] For example, the point array of the redundant figure corresponding to the inward contraction is arranged in a regular pattern. After the point array of the redundant figure corresponding to the inward contraction is mapped to the standard coordinate system through coordinate transformation, all y values ​​in the point array are arranged in ascending order and duplicates are removed to form a unique y value set such as {y 1, y 2… y n}; Calculate the effective x range of the new area to be filled at each y value. After the coordinate transformation, the new area to be filled is usually a polygon (such as L-shaped, rectangular, concave polygon, etc.). Figure 5 Take the L shape as an example; on each horizontal line corresponding to the y value, calculate the intersection of the horizontal line and the polygon boundary to obtain a valid x value interval. The calculation method may include: traversing each edge of the new area to be filled: the edge is in the form of a two-point type (x 1, y1) and (x2,y2); if the y range of the edge contains the y value of the current scan, calculate the intersection x of the horizontal line and the edge, that is ; All intersection points x are arranged in ascending order to alternately form valid x intervals. The first intersection point to the second intersection point is a valid interval, the third intersection point to the fourth intersection point is a valid interval, and so on; for all points in the point array at the current y value, check whether their x coordinates fall into the valid x interval: traverse the points on the current y horizontal line, for each point x point , check whether: x min x point x max (here x min and x max is the starting point and end point of a valid interval). If the point meets the conditions, the redundant graphics corresponding to the point can be filled. If a certain y value does not have any valid x interval, the judgment of this y value can be skipped.

[0047] For example: the point array is {(1,2), (3,2), (5,2), (2,4), (4,4), ...}, and the new area to be filled is an L-shaped area. Then, it can include: extracting a unique set of y values: y = {2,4, ...}; calculating the valid x interval for each y value: for example, for y = 2, the calculated valid interval is x∈[2,6]; for y = 4, the valid interval is x∈[1,3]∪[5,7]; judging whether point y = 2 falls into the interval: point (1,2) is not in the interval, point (3,2) is in the interval, and point (5,2) is in the interval. Judging whether point y = 4 falls into the interval: point (2,4) is in the interval, and point (4,4) is not in the interval. Therefore, the points that can be filled are {(3,2), (5,2), (2,4)}.

[0048] Through the method for implementing redundant graphics filling provided by the embodiment of the present application, the scanning line does not need to consider the graphics complexity of the redundant graphics array, and even if a large number of redundant graphics need to be filled, it will not affect the efficiency. At the same time, the coordinate transformation eliminates the oblique offset, greatly reducing the number of scanning intervals for the area to be filled, and in each interval, only a string of closed intervals of the area to be filled need to be obtained to determine the inclusion relationship, without the need for intersection operations, sorting, etc., which greatly reduces the operation compared to the traditional scanning line method.

[0049] The present application also provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are used to execute any of the above-mentioned methods for implementing redundant graphic filling.

[0050] The present application further provides a computer device, including a memory and a processor, wherein the memory stores the following instructions executable by the processor: used to execute the steps of any of the above-mentioned methods for implementing redundant graphic filling.

[0051] Figure 6 FIG. 1 is a schematic diagram of the structure of a device for implementing redundant pattern filling in an embodiment of the present application. Figure 6 As shown, it at least includes: a preprocessing module and a judgment module; wherein, A preprocessing module can be used to shrink the area to be filled inward according to the size of the redundant graphics to obtain a new area to be filled; The judgment module can be used to judge whether the point of the redundant figure corresponding to the inward contraction is within the new area to be filled.

[0052] In an exemplary embodiment, the inward contraction may include, but is not limited to, for example: The width of the redundant graphic enclosing outline is shrunk to the left, and the height of the redundant graphic enclosing outline is shrunk downward. At this time, the point of the redundant graphic corresponding to the inward contraction is the lower left corner point of the minimum enclosing rectangle of the redundant graphic; The width of the redundant graphic enclosing outline is shrunk to the right, and the height of the redundant graphic enclosing outline is shrunk downward. At this time, the point of the redundant graphic corresponding to the inward contraction is the lower right corner point of the minimum enclosing rectangle of the redundant graphic; The width of the redundant graphic enclosing outline is shrunk to the right, and the height of the redundant graphic enclosing outline is shrunk upward. At this time, the point of the redundant graphic corresponding to the inward contraction is the upper right corner point of the minimum enclosing rectangle of the redundant graphic; The width of the redundant graphic enclosing outline is shrunk to the left, and the height of the redundant graphic enclosing outline is shrunk upward. At this time, the point of the redundant graphic corresponding to the inward contraction is the upper left corner point of the minimum enclosing rectangle of the redundant graphic.

[0053] In an exemplary embodiment, the determination module may be used to: If the point of the redundant figure corresponding to the inward contraction falls within the new area to be filled, it is directly determined that the redundant figure where the point is located can be filled; if the point of the redundant figure corresponding to the inward contraction is not within the new area to be filled, there is no need to consider the redundant figure where the point is located.

[0054] The process of shrinking the area to be filled inward according to the size of the redundant graphics in the embodiment of the present application is actually an operation on the area to be filled. Based on the size of the redundant graphics, the boundary of the original area to be filled is translated inward, and the inclusion relationship judgment between the array unit and the area is converted into the inclusion relationship judgment between the point array and the area. In this way, the processing efficiency is greatly improved for scenes with a large number of filling graphics and a large filling area.

[0055] In an exemplary embodiment, it may also include: a coordinate transformation module, which is used to: map the point array composed of points of the redundant graphics corresponding to the inward contraction into a standard coordinate system through coordinate transformation, and the standard coordinate system is a grid aligned in the horizontal and vertical directions.

[0056] In an exemplary embodiment, the determination module may be used to: Scan in the y direction Figure 5 The y values ​​of the points corresponding to the inward contraction of all redundant figures in the point array shown, that is, traversing each y value in the point array (the points corresponding to the inward contraction of the redundant figures); Determine whether each y value falls within the range of the new area to be filled, and determine the redundant graphics corresponding to the points of the y value that fall within the new area to be filled as the redundant graphics that can be filled; the redundant graphics corresponding to the points of the y value that do not fall within the new area to be filled do not need to be considered.

[0057] Through coordinate transformation, the relationship between redundant graphics and new areas to be filled is simplified, the problem is converted into a standard straight line arrangement, the judgment logic is simplified, and complex calculations in rotating coordinates are avoided, thereby greatly reducing the calculation complexity.

[0058] Although the embodiments disclosed in this application are as above, the contents described are only embodiments adopted to facilitate understanding of this application and are not intended to limit this application. Any technician in the field to which this application belongs can make any modifications and changes in the form and details of implementation without departing from the spirit and scope disclosed in this application, but the scope of patent protection of this application shall still be based on the scope defined in the attached claims.

Claims

1. A method for implementing redundant graphics filling, characterized in that: include: The area to be filled is shrunk inward according to the size of the redundant pattern to obtain a new area to be filled; It is determined whether the points of the redundant graphics corresponding to the inward contraction are within the new area to be filled.

2. The method according to claim 1, wherein: The step of judging whether the point of the redundant graphic corresponding to the inward contraction is within the new area to be filled includes: If the point of the redundant graphic corresponding to the inward contraction falls within the new area to be filled, it is determined that the redundant graphic where the point is located can be filled; if the point of the redundant graphic corresponding to the inward contraction is not within the new area to be filled, the redundant graphic where the point is located does not need to be considered.

3. The method according to claim 1 or 2, wherein: The inward contraction includes: The width of the redundant graphic enclosing outline is shrunk to the left, and the height of the redundant graphic enclosing outline is shrunk downward; the point of the redundant graphic corresponding to the inward contraction is the lower left corner point of the minimum enclosing rectangle of the redundant graphic; or, The width of the redundant graphic enclosing outline is shrunk to the right, and the height of the redundant graphic enclosing outline is shrunk downward; the point of the redundant graphic corresponding to the inward contraction is the lower right corner point of the minimum enclosing rectangle of the redundant graphic; or, The width of the redundant graphic enclosing outline is shrunk to the right, and the height of the redundant graphic enclosing outline is shrunk upward; the point of the redundant graphic corresponding to the inward contraction is the upper right corner point of the minimum enclosing rectangle of the redundant graphic; or, The width of the redundant graphic enclosing outline is shrunk to the left, and the height of the redundant graphic enclosing outline is shrunk upward; the point of the redundant graphic corresponding to the inward contraction is the upper left corner point of the minimum enclosing rectangle of the redundant graphic.

4. The method according to claim 1, wherein the step of determining whether the point of the redundant pattern corresponding to the inward contraction is within the new area to be filled further comprises: By coordinate transformation, the point array consisting of the points of the redundant graphics corresponding to the inward contraction is mapped into a standard coordinate system; wherein the standard coordinate system is a grid aligned in the horizontal and vertical directions.

5. The method according to claim 4, wherein: The step of judging whether the point of the redundant graphic corresponding to the inward contraction is within the new area to be filled includes: Scanning vertical coordinate values ​​of points corresponding to inward contraction of all redundant patterns in the dot array in the vertical direction; Determine whether each vertical coordinate value falls within the range of the new area to be filled, and determine the redundant graphics corresponding to the points with vertical coordinate values ​​that fall within the new area to be filled as redundant graphics that can be filled, and the redundant graphics corresponding to the points with vertical coordinate values ​​that do not fall within the new area to be filled do not need to be considered.

6. A computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are used to execute the method for implementing redundant graphic filling as described in any one of claims 1 to 5.

7. A computer device comprising a memory and a processor, wherein: The memory stores the following instructions executable by the processor: used to execute the steps of the method for implementing redundant graphic filling as described in any one of claims 1-5.

8. A device for implementing redundant pattern filling, characterized in that: include: Preprocessing module, judgment module; among them, A preprocessing module, used for shrinking the area to be filled inward according to the size of the redundant graphics to obtain a new area to be filled; The judging module is used to judge whether the point of the redundant figure corresponding to the inward contraction is within the new area to be filled.

9. The apparatus according to claim 8, further comprising: Coordinate transformation module for: By coordinate transformation, the point array consisting of the points of the redundant graphics corresponding to the inward contraction is mapped into a standard coordinate system; wherein the standard coordinate system is a grid aligned in the horizontal and vertical directions.

10. The device according to claim 9, wherein: The judging module is used for: Scanning vertical coordinate values ​​of points corresponding to inward contraction of all redundant patterns in the dot array in the vertical direction; Determine whether each vertical coordinate value falls within the range of the new area to be filled, and determine the redundant graphics corresponding to the points with vertical coordinate values ​​that fall within the new area to be filled as redundant graphics that can be filled, and the redundant graphics corresponding to the points with vertical coordinate values ​​that do not fall within the new area to be filled do not need to be considered.

Images