CN115906215A - Method and device for generating graph in layout, storage medium and electronic equipment - Google Patents
Method and device for generating graph in layout, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN115906215A CN115906215A CN202211636191.1A CN202211636191A CN115906215A CN 115906215 A CN115906215 A CN 115906215A CN 202211636191 A CN202211636191 A CN 202211636191A CN 115906215 A CN115906215 A CN 115906215A
- Authority
- CN
- China
- Prior art keywords
- pixel points
- pixel
- generating
- layout
- graph
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
The invention discloses a method and a device for generating a graph in a layout, a storage medium and electronic equipment. According to the method, firstly, a layout area used for generating the target graph on the layout is obtained, then pixel points in the layout area are set as first pixel points, and finally, proper first pixel points are screened out by traversing all the first pixel points to generate the target graph.
Description
Technical Field
The present invention relates to the field of integrated circuit design technologies, and in particular, to a method and an apparatus for generating a pattern in a layout, a storage medium, and an electronic device.
Background
In the integrated circuit layout design, a plurality of circular target patterns are often required to be drawn in some areas, for example, circular through holes are required to be drawn for electrical connection of different board layers of a circuit board; drawing a circular bonding pad for connecting the circuit board with an external device; to support the flip chip, circular pillars need to be drawn. In the process of drawing the target graphs, it is required to ensure that the target graphs cannot be overlapped with each other and cannot be overlapped with other graphs on the layout.
The inventor of the present application found in long-term research and development that drawing of a target circle needs to be done manually by a designer, however, in some large-scale layouts, the number of target figures is as many as hundreds of thousands or millions, and in such a case, manual drawing is inefficient and error-prone.
Disclosure of Invention
The invention aims to provide a method, a device, a storage medium and electronic equipment for generating a graph in a layout, so as to solve the problems that in the prior art, the efficiency of manually drawing a target graph is low and mistakes are easy to make, realize the automatic drawing of the target graph, improve the drawing efficiency and avoid mistakes.
In order to solve the above technical problem, the present invention provides a method for generating a graph in a layout, comprising:
obtaining a layout area on a layout for generating a target graph, wherein the target graph is circular;
setting the pixel points in the layout area as first pixel points;
traversing all the first pixel points according to a preset sequence, and selecting other pixel points which are not the first pixel points and the first pixel points of which the distances between the generated target graph and the other pixel points are larger than a preset threshold value as central points to generate the target graph, wherein the preset threshold value is not smaller than the radius of the target graph.
Preferably, traversing all the first pixel points according to a preset sequence, and selecting other pixel points than the first pixel point and the first pixel point with a distance between the first pixel point and the generated target graph larger than the radius of the target graph as a center point to generate the target graph includes:
a pixel point obtaining step: selecting an undetected pixel point from all the first pixel points according to a preset sequence;
detecting whether a circular range taking the detection pixel point as a circle center and the radius as a preset threshold covers the pixel point of the non-first pixel point and the generated target graph or not;
if the detection result is negative, selecting the detection pixel points as central points to generate a target graph, and transferring to the pixel point obtaining step until all the first pixel points are selected;
and if the detection result is yes, turning to the pixel point acquisition step until all the first pixel points are selected.
Preferably, the selecting the detection pixel point as a central point to generate a target pattern further includes:
and setting the first pixel points in the coverage range of the target graph as second pixel points.
Preferably, before traversing all the first pixel points according to the preset sequence, the method further includes:
acquiring an obstacle in the target area;
determining obstacle detouring boundaries at the periphery of the obstacle, wherein the shortest distance from each point on the obstacle detouring boundaries to the obstacle is equal;
and setting the first pixel point in the barrier-bypassing boundary as a third pixel point.
Preferably, the obstacle is a non-closed line, and the obstacle boundary is determined around the obstacle, including:
generating a strip-shaped graph with the width as a preset width by taking each line segment of the non-closed line as a central line;
generating an expansion circle with the diameter of the preset width by taking each end point of the non-closed line as a circle center;
and taking the maximum boundary formed by combining the strip-shaped graph and the expanded circle as a barrier-bypassing boundary.
Preferably, the obstacle is a polygon, and the determining of the obstacle-detouring boundary at the periphery of the obstacle includes:
generating a strip-shaped graph with the width as a preset width by taking each side line of the polygon as a central line;
generating an expansion circle with the diameter of the preset width by taking each end point of the polygon as a circle center;
and combining the strip-shaped graph and the expanded circle to form the maximum boundary of the outermost periphery as a barrier boundary.
Preferably, the preset sequence is a sequence from the front to the back.
In order to solve the above technical problem, the present invention further provides a device for generating a graph in a layout, including:
the region acquisition module is used for acquiring a layout region used for generating a target graph on a layout, and the target graph is circular;
the pixel selection module is used for setting the pixel points in the target area as first pixel points;
and the pixel traversal module is used for traversing all the first pixel points according to a preset sequence, selecting other pixel points which are not the first pixel points and the first pixel points of which the distance between the first pixel points and the generated target graph is greater than a preset threshold value as central points to generate the target graph, wherein the preset threshold value is not less than the radius of the target graph.
In order to solve the above technical problem, the present invention further provides a storage medium, where a computer program is stored in the storage medium, and the computer program is configured to execute any one of the methods for generating a graph in a layout described in the foregoing embodiments.
In order to solve the above technical problem, the present invention further provides an electronic device, which includes a memory and a processor, where the memory stores a computer program, and the processor is configured to run the computer program to execute any one of the methods for generating a graph in a layout.
The method for generating the graph in the layout is different from the situation of the prior art, the layout area used for generating the target graph in the layout is obtained, the pixel points in the layout area are set as first pixel points, and finally the target graph is generated by traversing all the first pixel points to screen out proper first pixel points.
The device for generating the graph in the layout, the storage medium and the electronic equipment provided by the invention belong to the same inventive concept as the method for generating the graph in the layout, so the device has the same beneficial effects and is not repeated herein.
Drawings
Fig. 1 is a schematic flow chart of a method for generating a graph in a layout according to a first embodiment of the present invention.
Fig. 2 is a schematic diagram of generating a target pattern by using the method for generating a pattern in a layout according to the first embodiment of the present invention.
Fig. 3 is a schematic flow chart of step S3 in the method shown in fig. 1.
Fig. 4 is a flowchart illustrating a method for generating a pattern in a layout according to a second embodiment of the present invention.
Fig. 5 is a schematic diagram of generating a target graph by using the method for generating a graph in a layout according to the second embodiment of the present invention.
Fig. 6 is a schematic diagram of a barrier boundary when the barrier is a non-closed line.
Fig. 7 is a schematic diagram of a barrier boundary when the barrier is a polygon.
Fig. 8 is a partial schematic diagram of a layout after a target graph is generated in a specific application example.
Fig. 9 is a schematic block diagram of an apparatus for generating a graph in a layout according to a third embodiment of the present invention.
Detailed Description
The following describes in more detail embodiments of the present invention with reference to the schematic drawings. Advantages and features of the present invention will become apparent from the following description and claims. It is to be noted that the drawings are in a very simplified form and are not to precise scale, which is provided for the purpose of facilitating and clearly illustrating embodiments of the present invention.
In the description of the present invention, it is to be understood that the terms "center", "upper", "lower", "left", "right", and the like indicate orientations or positional relationships based on those shown in the drawings, and are only for convenience in describing the present invention and simplifying the description, but do not indicate or imply that the device or element referred to must have a specific orientation, be constructed in a specific orientation, and be operated, and thus, should not be construed as limiting the present invention.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
Referring to fig. 1, a first embodiment of the present invention provides a method for generating a pattern in a layout, including the following steps:
s1: and acquiring a layout area for generating a target graph on the layout, wherein the target graph is circular.
In the embodiment of the present application, before generating a target pattern on a layout, a layout region for generating the target pattern is acquired first. The layout area may be a preset area on the layout, or may be an area selected in response to a user instruction, for example, a frame selection instruction, and a frame selection area is obtained on the layout according to the frame selection instruction.
S2: and setting the pixel points in the layout area as first pixel points.
In the embodiment of the application, the layout is essentially an image in a computer, and the image is composed of pixel points, so that the layout comprises a plurality of pixel points. The pixel points in the layout area are set as first pixel points, and can be distinguished from the pixel points outside the layout area. As shown in fig. 2, the layout area a is a rectangle, the pixel point P0 on the layout is represented by a square with a cross, and after the pixel point P0 in the layout area a is set as the first pixel point P1, the first pixel point P1 is represented by a hollow square.
S3: traversing all the first pixel points according to a preset sequence, and generating a target graph at the first pixel points of which the distance between other pixel points than the non-first pixel points and the generated target graph is greater than a preset threshold value, wherein the preset threshold value is not less than the radius of the target graph.
In this embodiment of the present application, the preset sequence may be any sequence, and since the pixel points are arranged in an array, in order to generate a sufficient number of target patterns, the preset sequence in this embodiment is preferably a preceding or following sequence. That is to say, first pixel points are traversed from the first row according to the preset direction sequence, after the first pixel points of the first row are traversed, the first pixel points are traversed from the second row according to the preset direction sequence, and so on until the last first pixel point is traversed. The preset direction may be a left-to-right direction or a right-to-left direction.
When traversing each first pixel point, whether the distance between the currently traversed first pixel point and other pixel points of the non-first pixel point and the generated target graph is larger than a preset threshold value needs to be judged, and the target graph is generated at the currently traversed first pixel point only if the distance is larger than the preset threshold value. It should be noted that the distance between the first pixel and the other pixels other than the first pixel and the generated target pattern is the shortest distance between the first pixel and the other pixels.
Because the distance between the first pixel point for generating the target graph and other pixel points of the non-first pixel point is greater than the preset threshold, the distance between the first pixel point and the generated target graph is also greater than the preset threshold, and the preset threshold is not less than the radius of the target graph, after the target graph is generated by the currently traversed first pixel point, the target graph cannot be overlapped with other graphs on the layout, and the target graphs cannot be overlapped with each other.
As shown in fig. 2, the first row of the first pixel points P1 is the first row at the bottom, the last row of the first pixel points P1 is the first row at the top, and the first pixel points P1 in each row are sorted from left to right. Then the sequence number of the first pixel point P1 in the first row is (1,1), the sequence number of the second first pixel point P1 in the first row is (1,2), … …, the sequence number of the last first pixel point P1 in the first row is (1,10), the sequence number of the first pixel point P1 in the second row is (2,1), the sequence number of the second first pixel point P1 in the second row is (2,2), … …, and the sequence number of the last first pixel point P1 in the last row is (8,10). Assuming that the side length of the first pixel point P1 is 1, the preset threshold is 1.1, and the radius of the target graph is 1, finally 9 target graphs A1 are generated in the layout area a. In the figure, the target pattern A1 is represented by a hatched filled circle.
According to the method for generating the graph in the layout, the layout area for generating the target graph is firstly obtained, then the pixel points in the layout area are set as the first pixel points, and finally the appropriate first pixel points are screened out by traversing all the first pixel points to generate the target graph.
In this embodiment, please refer to fig. 3, all the first pixel points are traversed according to the preset sequence, and the target graph is generated at the first pixel point where the distance between the other pixel points than the first pixel point and the generated target graph is greater than the preset threshold, that is, step S3 specifically includes:
s31: a pixel point obtaining step: selecting an undetected pixel point from all the first pixel points according to a preset sequence;
s32: detecting whether a circular range taking the detection pixel point as a circle center and the radius as a preset threshold value covers the pixel point which is not the first pixel point and the generated target graph or not;
s33: if the detection result is negative, generating a target graph at the detection pixel point, and turning to the pixel point acquisition step S31 until all the first pixel points are selected;
if the detection result is yes, go to the pixel point obtaining step S31 until all the first pixel points are selected.
For example, as shown in fig. 2, when each first pixel point (1,1) in the first row is used as a detection pixel point, since the circular range with the detection pixel point (1,1) as the center and the radius as the preset threshold covers other pixel points P0, the detection pixel point becomes (1,2), similarly, the circular range with the detection pixel point (1,2) as the center and the radius as the preset threshold covers other pixel points P0, and so on, after traversing the first pixel point in the first row, traversing the first pixel point in the second row starts, and when each first pixel point (2,1) in the second row is used as a detection pixel point, since the circular range with the detection pixel point (2,1) as the center and the radius as the preset threshold covers other pixel points P0, the detection pixel point becomes (2,2), the detection pixel point (4234 zxft 3534) as the center and the radius as the preset threshold covers other pixel points P0, no target image a 5364 is generated, and thus no target image a is generated as a target image 5364.
In order to accelerate the traversal speed, further, generating a target graph at the detection pixel point, further comprising:
and setting the first pixel points in the coverage range of the target graph as second pixel points.
After the first pixel point is changed into the second pixel point, the first pixel point can not be selected again, and the next first pixel point can be directly traversed. At this time, the pixel point other than the first pixel point includes a second pixel point P2 in addition to the pixel point P0.
As shown in fig. 2, after the first target graphic A1 is generated, the first pixel P1 with the sequence number of (2,3) covered by the first target graphic A1 is changed into the second pixel P2, so that the second pixel P2 with the sequence number of (2,3) is skipped when the next detection pixel is selected, and the first pixel P1 with the sequence number of (2,4) is selected as the detection pixel. In the figure, the second pixel point P2 is represented by a square filled with dotted shading. The number of the traversed first pixel points P1 is reduced, so that the traversal speed can be increased.
Referring to fig. 4, a second embodiment of the present invention provides a method for generating a graph in a layout, where the method of this embodiment is based on the method of the first embodiment, and except for including all technical features of the method of the first embodiment, the method of this embodiment further includes the following steps before traversing all first pixel points according to a preset order, that is, before step S3:
s4: obtaining obstacles in a layout area;
s5: determining a barrier-surrounding boundary at the periphery of the barrier, wherein the shortest distance from each point on the barrier-surrounding boundary to the barrier is equal;
s6: and setting the first pixel point in the barrier-bypassing boundary as a third pixel point.
In this embodiment, the obstacle is a graph that the target graph needs to be avoided, and the obstacle may be a preset graph on the layout or a graph selected in response to an instruction of the user. The obstacle may be in the same layer as the target pattern or in a different layer.
As shown in fig. 5, the layout area a is identical to that of fig. 2 except that the obstacles B and C exist in the layout area a of fig. 5. Obstacle-detouring boundaries B1 and C1 are determined on the peripheries of the obstacles B and C, and first pixel points P1 in the obstacle-detouring boundaries B1 and C1 are set as third pixel points P3. In the figure, the third pixel point P3 is represented by a square filled with cross hatching. At this time, the pixel point of the non-first pixel point includes a third pixel point P3 in addition to the pixel point P0 and the second pixel point P2.
The obstacle can be in any shape, the common obstacles are non-closed lines and polygons, the non-closed lines are generally represented as signal lines in the layout, and the polygons are graphs of components in the layout.
Specifically, when the obstacle is a non-closed line, determining a barrier-surrounding boundary at the periphery of the obstacle, including:
generating a strip-shaped graph with the width as a preset width by taking each line segment of the non-closed line as a central line;
respectively generating an expanded circle with a diameter of a preset width by taking each end point of the non-closed line as a circle center;
and taking the maximum boundary after the combination of the strip-shaped patterns and the expanded circles as a barrier-bypassing boundary.
As shown in fig. 6, the non-closed line includes two line segments, a strip-shaped graph with a width of a preset width d is generated by using the two line segments as a center line, an expanded circle with a diameter of d is generated by using three end points as circle centers, and a maximum boundary after the strip-shaped graph and the expanded circle are combined is a barrier-bypassing boundary B1.
When the obstacle is a polygon, determining a barrier-surrounding boundary at the periphery of the obstacle, wherein the barrier-surrounding boundary comprises:
generating a strip-shaped graph with the width as a preset width by taking each side line of the polygon as a central line;
generating an expansion circle with the diameter of the preset width by taking each end point of the polygon as a circle center;
and combining the strip-shaped graph and the expanded circle to form the maximum boundary of the outermost periphery as a barrier boundary.
As shown in fig. 7, the polygon is a rectangle, a strip-shaped graph with a width of a preset width d is generated by taking four side lines as a center line, an expanded circle with a diameter of d is generated by taking four end points as circle centers, and the maximum boundary of the outermost periphery after the strip-shaped graph and the expanded circle are combined is the obstacle-detouring boundary C1.
The target patterns generated by the method of the present embodiment do not overlap each other, and the target patterns do not overlap the obstacle. As shown in fig. 8, in a specific application example, after the target patterns are constructed in the layout area of a layout by using the method according to the embodiment of the present invention, every two target patterns are spaced at a certain distance, and the target patterns are spaced at a certain distance from the obstacles in the layout area, in the drawing, circles filled with shadows represent the target patterns, and except for the target patterns, other patterns are all obstacles. It should be noted that the grid lines in the drawing do not represent pixel points, but are grid lines of a drawing board used for drawing graphics on a computer interface.
Referring to fig. 9, a third embodiment of the present invention provides an apparatus for generating a pattern in a layout. The device includes:
the region acquisition module 1 is configured to acquire a layout region on the layout for generating a target pattern, where the target pattern is a circle. In the embodiment of the present application, before generating a target pattern on a layout, a layout region for generating the target pattern is acquired first. The layout area may be a preset area on the layout, or may be an area selected in response to a user instruction, for example, a frame selection instruction, and a frame selection area is obtained on the layout according to the frame selection instruction.
And the pixel selection module 2 is used for setting the pixel points in the target area as first pixel points. In the embodiment of the application, the layout is essentially an image in a computer, and the image is composed of pixel points, so that the layout comprises a plurality of pixel points. The pixel points in the layout area are set as first pixel points, and can be distinguished from the pixel points outside the layout area.
And the pixel traversing module 3 is used for traversing all the first pixel points according to a preset sequence, and generating a target graph at the first pixel points, wherein the distance between the other pixel points which are not the first pixel points and the generated target graph is greater than a preset threshold, and the preset threshold is not less than the radius of the target graph.
In the embodiment of the present application, the preset sequence may be any sequence, and since the pixel points are arranged in an array, in order to generate a sufficient number of target patterns, the preset sequence in this embodiment is preferably a sequence that is listed in advance. That is to say, the pixel traversal module 3 first traverses the first pixel points from the first row according to the preset direction sequence, and after the first pixel points in the first row are traversed, traverses the first pixel points from the second row according to the preset direction sequence, and so on until the last first pixel point is traversed. The preset direction may be a left-to-right direction or a right-to-left direction.
When traversing each first pixel point, the pixel traversing module 3 needs to determine whether the distance between the currently traversed first pixel point and other pixel points other than the first pixel point and the generated target graph is greater than a preset threshold, and only if the distance is greater than the preset threshold, the target graph is generated at the currently traversed first pixel point. It should be noted that the distance between the first pixel and the other pixels other than the first pixel and the generated target pattern is the shortest distance between the first pixel and the other pixels.
Because the distance between the first pixel point for generating the target graph and other pixel points of the non-first pixel point is greater than the preset threshold, the distance between the first pixel point and the generated target graph is also greater than the preset threshold, and the preset threshold is not less than the radius of the target graph, after the target graph is generated by the currently traversed first pixel point, the target graph cannot be overlapped with other graphs on the layout, and the target graphs cannot be overlapped with each other.
The device for generating the graph in the layout provided by the embodiment of the application firstly acquires the layout area for generating the target graph, then sets the pixel points in the layout area as the first pixel points, and finally selects the appropriate first pixel points to generate the target graph by traversing all the first pixel points.
In particular, the pixel traversal module 3 is specifically configured to:
selecting an undetected pixel point from all the first pixel points according to a preset sequence;
detecting whether a circular range taking the detection pixel point as a circle center and the radius as a preset threshold covers the pixel point of the non-first pixel point and the generated target graph or not;
if the detection result is negative, generating a target graph at the detection pixel points, and selecting one undetected pixel point from all the first pixel points according to a preset sequence until all the first pixel points are selected;
if the detection result is yes, selecting an undetected pixel point from all the first pixel points according to a preset sequence until all the first pixel points are selected.
Further, the pixel traversal module 3 is configured to set the first pixel in the coverage range of the target graph as the second pixel after the target graph is generated by the detection pixel.
Optionally, before the pixel traversing module 3 traverses all the first pixel points according to the preset order, the apparatus further includes:
the obstacle acquisition module is used for acquiring obstacles in the layout area;
the boundary determining module is used for determining obstacle detouring boundaries at the periphery of the obstacle, wherein the shortest distances from each point on the obstacle detouring boundaries to the obstacle are equal;
and the pixel selection module 2 is further configured to set the first pixel point in the barrier boundary as a third pixel point.
Specifically, the obstacle is a non-closed line, and the boundary determining module is specifically configured to:
generating a strip-shaped graph with the preset width by taking each line segment of the non-closed line as a central line;
respectively generating an expanded circle with the diameter of a preset width by taking each end point of the non-closed line as a circle center;
and taking the maximum boundary after the combination of the strip-shaped patterns and the expanded circles as a barrier-bypassing boundary.
The obstacle is a polygon, and the boundary determination module is specifically configured to:
generating a strip-shaped graph with the width as a preset width by taking each side line of the polygon as a central line;
generating an expanded circle with a diameter of a preset width by taking each end point of the polygon as a circle center;
and combining the strip-shaped pattern and the expanded circle to form the maximum boundary of the outermost periphery as a barrier boundary.
The invention further provides a storage medium having stored therein a computer program arranged to execute the method of generating a graph in a layout of any of the preceding embodiments when run.
Specifically, in this embodiment, the storage medium may include, but is not limited to: various media capable of storing computer programs, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.
The invention also provides an electronic device comprising a memory in which a computer program is stored and a processor arranged to run the computer program to perform the method of generating a pattern in a layout of any of the preceding embodiments.
In particular, the memory and the processor may be connected by a data bus. In addition, the electronic device may further include a transmission device and an input/output device, wherein the transmission device is connected to the processor, and the input/output device is connected to the processor.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example" or "a specific example" or the like are intended to mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. And the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments. Furthermore, various embodiments or examples described in this specification can be combined and combined by those skilled in the art.
The above description is only a preferred embodiment of the present invention, and does not limit the present invention in any way. It will be understood by those skilled in the art that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. A method of generating a pattern in a layout, comprising:
obtaining a layout area on a layout for generating a target graph, wherein the target graph is circular;
setting the pixel points in the layout area as first pixel points;
traversing all the first pixel points according to a preset sequence, and generating a target graph at the first pixel points, wherein the distance between other pixel points which are not the first pixel points and the generated target graph is greater than a preset threshold value, and the preset threshold value is not less than the radius of the target graph.
2. The method of claim 1, wherein traversing all the first pixels according to a predetermined sequence, and generating the target graph at the first pixels having a distance between other pixels than the first pixels and the generated target graph greater than a predetermined threshold comprises:
a pixel point obtaining step: selecting an undetected pixel point from all the first pixel points according to a preset sequence;
detecting whether a circular range taking the detection pixel point as a circle center and the radius as a preset threshold covers the pixel point of the non-first pixel point and the generated target graph or not;
if the detection result is negative, generating a target graph at the detection pixel point, and turning to the pixel point acquisition step until all the first pixel points are selected;
if the detection result is yes, the step of obtaining the pixel points is switched to until all the first pixel points are selected.
3. The method of claim 2, wherein generating a target pattern at the detection pixel further comprises:
and setting the first pixel points in the coverage range of the target graph as second pixel points.
4. The method according to any one of claims 1 to 3, wherein before traversing all the first pixels according to the preset order, the method further comprises:
obtaining obstacles in the layout area;
determining obstacle detouring boundaries at the periphery of the obstacle, wherein the shortest distance from each point on the obstacle detouring boundaries to the obstacle is equal;
and setting the first pixel point in the barrier-bypassing boundary as a third pixel point.
5. The method of claim 4, wherein the obstacle is a non-closed line, and wherein determining a detour boundary around the obstacle comprises:
generating a strip-shaped graph with the width as a preset width by taking each line segment of the non-closed line as a central line;
generating an expansion circle with the diameter of the preset width by taking each end point of the non-closed line as a circle center;
and taking the maximum boundary after the strip-shaped graph and the expanded circle are combined as a barrier-bypassing boundary.
6. The method of claim 4, wherein the obstacle is a polygon, and wherein determining a barrier-bounding boundary at a periphery of the obstacle comprises:
generating a strip-shaped graph with the width as a preset width by taking each side line of the polygon as a central line;
generating an expanded circle with the diameter as the preset width by taking each end point of the polygon as a circle center;
and combining the strip-shaped graph and the expanded circle to form the maximum boundary of the outermost periphery as a barrier boundary.
7. The method of claim 1, wherein the predetermined order is a front-to-back order.
8. An apparatus for generating a pattern in a layout, comprising:
the region acquisition module is used for acquiring a layout region used for generating a target graph on a layout, and the target graph is circular;
the pixel selection module is used for setting pixel points in the target area as first pixel points;
and the pixel traversing module is used for traversing all the first pixel points according to a preset sequence, and generating a target graph at the first pixel points, wherein the distance between the first pixel points and other non-first pixel points and the generated target graph is greater than a preset threshold, and the preset threshold is not less than the radius of the target graph.
9. A storage medium, characterized in that the storage medium has stored therein a computer program arranged to perform, when running, the method of generating a graphic in a layout according to any one of claims 1 to 7.
10. An electronic device, characterized in that it comprises a memory in which a computer program is stored and a processor arranged to run the computer program to perform the method of generating a graphic in a layout according to any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211636191.1A CN115906215A (en) | 2022-12-16 | 2022-12-16 | Method and device for generating graph in layout, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211636191.1A CN115906215A (en) | 2022-12-16 | 2022-12-16 | Method and device for generating graph in layout, storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115906215A true CN115906215A (en) | 2023-04-04 |
Family
ID=86480656
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211636191.1A Pending CN115906215A (en) | 2022-12-16 | 2022-12-16 | Method and device for generating graph in layout, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115906215A (en) |
-
2022
- 2022-12-16 CN CN202211636191.1A patent/CN115906215A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6083300B2 (en) | Program, parallel operation method, and information processing apparatus | |
| US5847968A (en) | Printed circuit board CAD device which alternates placing components and routing connectors between them | |
| US8086991B1 (en) | Automatic creation of vias in electrical circuit design | |
| JP3529563B2 (en) | Semiconductor integrated circuit re-layout method and medium recording semiconductor integrated circuit re-layout program | |
| JP5223790B2 (en) | Printed circuit board design support program, printed circuit board design support method, and printed circuit board design support apparatus | |
| US20040211071A1 (en) | Estimation of overlap of polygons | |
| US20060123373A1 (en) | Density driven layout for RRAM configuration module | |
| CN115906215A (en) | Method and device for generating graph in layout, storage medium and electronic equipment | |
| CN111985014B (en) | Modeling method and system based on standard atlas | |
| CN113434991A (en) | Method and device for generating geothermal coil, electronic equipment and readable storage medium | |
| CN105138711A (en) | Primitive indexing method, primitive detecting method, primitive indexing device and a primitive detecting device | |
| CN111914123B (en) | Information promotion method, device, electronic equipment and storage medium | |
| US8468489B2 (en) | Computer aided design system and method | |
| CN113642281A (en) | PCB design drawing detection method, device, equipment and medium | |
| US5617328A (en) | Automatic code pattern generator for repetitious patterns in an integrated circuit layout | |
| CN113420355B (en) | Floor processing method and device and electronic equipment | |
| CN113867862B (en) | List page layout method and computing device | |
| CN117436399B (en) | Automatic layout method and device of circuit schematic diagram device and electronic equipment | |
| CN117952819A (en) | Multi-layer reading method, direct memory access module, processor and equipment | |
| CN117010322B (en) | Standard unit checking method, device and equipment | |
| US11182430B2 (en) | Low ink drawings of dense graphs | |
| JP2921454B2 (en) | Wiring method of integrated circuit | |
| CN117094277A (en) | Method and device for arranging chips in wafer, storage medium and electronic equipment | |
| CN115146577A (en) | Method, system, medium, and electronic device for aligning points of integrated circuit layout pattern | |
| JP2002251624A (en) | System, method, and program for arranging object, and recording medium for recording program for arranging object |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |