CN117556781B - Target pattern determining method and device, electronic equipment and storage medium - Google Patents

Target pattern determining method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN117556781B
CN117556781B CN202410046422.6A CN202410046422A CN117556781B CN 117556781 B CN117556781 B CN 117556781B CN 202410046422 A CN202410046422 A CN 202410046422A CN 117556781 B CN117556781 B CN 117556781B
Authority
CN
China
Prior art keywords
vertex
target
determining
region
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.)
Active
Application number
CN202410046422.6A
Other languages
Chinese (zh)
Other versions
CN117556781A (en
Inventor
请求不公布姓名
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Xingxin Technology Co ltd
Original Assignee
Hangzhou Xingxin Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hangzhou Xingxin Technology Co ltd filed Critical Hangzhou Xingxin Technology Co ltd
Priority to CN202410046422.6A priority Critical patent/CN117556781B/en
Publication of CN117556781A publication Critical patent/CN117556781A/en
Application granted granted Critical
Publication of CN117556781B publication Critical patent/CN117556781B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/30—Circuit design
    • G06F30/39—Circuit design at the physical level
    • G06F30/398—Design verification or optimisation, e.g. using design rule check [DRC], layout versus schematics [LVS] or finite element methods [FEM]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/30—Circuit design
    • G06F30/39—Circuit design at the physical level
    • G06F30/392—Floor-planning or layout, e.g. partitioning or placement
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/30—Circuit design
    • G06F30/39—Circuit design at the physical level
    • G06F30/394—Routing

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Evolutionary Computation (AREA)
  • Geometry (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Architecture (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Image Generation (AREA)
  • Processing Or Creating Images (AREA)

Abstract

The application provides a method, a device, electronic equipment and a storage medium for determining a target pattern, and relates to the field of data processing, wherein the method comprises the following steps: obtaining a target graph group, determining a plurality of candidate areas and second identifications of the candidate areas based on first identifications of a plurality of vertexes in the target graph group, wherein the target graph group comprises two graphs respectively belonging to different layers in a layout and first identifications of each vertex in the graphs, the first identifications indicate graph changes of areas where the vertexes are positioned, and the second identifications represent graph numbers of the candidate areas; determining a target area and a first mark of each vertex of the target area based on the second marks of the candidate areas, all the first marks and the first mapping relation; the target graph is determined based on the target area and the first identification of each vertex of the target area, so that the problem that the prior Boolean operation on different graphs in different layers is overlong and cannot be directly applied to the design of a high-performance computing tool is solved.

Description

Target pattern determining method and device, electronic equipment and storage medium
Technical Field
The present application relates to the field of data processing, and in particular, to a method and apparatus for determining a target pattern, an electronic device, and a storage medium.
Background
The layout of an integrated circuit is made up of layers, each layer containing several to hundreds of thousands of two-dimensional graphics. When a signing flow is carried out on a layout, in a signing flow verification tool, expressions provided by a process library often relate to a plurality of layers, and the expressions can be disassembled into a plurality of Boolean operation expressions. The current common practice is to perform Boolean operation on the patterns between the patterns to determine the overlapping area between the patterns, and the method is simple to implement, but when the number scale of the patterns reaches more than 10k, the operation time is too long, so that the method cannot be directly applied to the design of high-performance calculation tools.
Disclosure of Invention
The application provides a target pattern determining method, a target pattern determining device, electronic equipment and a storage medium.
In one aspect, an embodiment of the present application provides a method for determining a target image, where the method includes:
Obtaining a target graph group, and determining a plurality of candidate areas and second identifications of the candidate areas based on first identifications of a plurality of vertexes in the target graph group, wherein the target graph group comprises two graphs respectively belonging to different layers in a layout and first identifications of each vertex in the graphs, the first identifications indicate the graph state change of the area where the vertexes are located, and the second identifications represent the graph number of the candidate areas;
determining a target area and a first mark of each vertex of the target area based on the second marks of the candidate areas, all the first marks and a first mapping relation;
a target graph is determined based on the target region and the first identification of each vertex of the target region.
Wherein the determining a plurality of candidate regions and a second identification of the candidate regions based on the first identifications of the plurality of vertices in the target graphics group comprises:
Dividing the target graph group in a first preset direction based on the plurality of vertexes to obtain a plurality of candidate areas;
And determining a second identification of the candidate region based on the first identification of the vertex of the candidate region and the second mapping relation.
Wherein the determining the second identifier of the candidate region based on the first identifier of the vertex of the candidate region and the second mapping relation includes:
updating the second identifier of the t candidate region based on the first identifier of the vertex in the t candidate region and the second mapping relation in the first preset direction to obtain the second identifier of the t+1st candidate region, wherein t is a positive integer.
Wherein the method further comprises:
The target region is determined based on boolean operators of the target graphic group.
Wherein the determining the target region based on the boolean operator of the target graphic group comprises:
If the Boolean operator of the target graph group is a first operator, determining that the target area is an overlapping area of two graphs in the target graph group;
If the Boolean operator of the target graph group is a second operator, determining that the target region is a region except the designated graph in the target graph group;
And if the Boolean operator of the target graph group is a third operator, determining the target region as a region except the overlapping region in the target graph group.
Wherein the method further comprises:
Determining a first initial vertex from all vertices of the graph;
traversing all vertexes of the graph from the first initial vertex according to a second preset direction;
Determining a first direction of the current vertex based on the coordinates of the current vertex and the previous vertex, and determining a second direction of the current vertex based on the coordinates of the current vertex and the next vertex;
determining a first identification of the current vertex based on the first direction and the second direction of the current vertex;
and after the traversing is completed, obtaining a first mark of each vertex in the graph.
Wherein the determining the target graph based on the target region and the first identification of each vertex of the target region comprises:
grouping all vertexes of the target area according to ordinate to obtain a plurality of vertex coordinate groups;
Connecting vertexes with serial numbers of 2i and 2i+1 in the vertex coordinate set, wherein i is a natural number;
Creating a vertex cache sequence, determining a second initial vertex, and traversing all vertices from the second initial vertex according to a third preset direction;
If the vertex cache sequence has a vertex with the same abscissa as the current vertex, connecting the current vertex with the vertex, and removing the vertex from the vertex cache sequence;
if no vertex with the abscissa identical to the abscissa of the current vertex exists in the vertex cache sequence, adding the current vertex into the vertex cache sequence;
And after the traversing is completed, obtaining the target graph.
Another aspect of the embodiments of the present application provides a device for determining a target pattern, including:
The computing module is used for obtaining a target graph group and determining a plurality of candidate areas and second identifications of the candidate areas based on first identifications of a plurality of vertexes in the target graph group, wherein the target graph group comprises two graphs respectively belonging to different layers in a layout and first identifications of each vertex in the graphs, the first identifications indicate graph changes of areas where the vertexes are located, and the second identifications represent the number of graphs of the candidate areas;
The computing module is further configured to determine a target area and a first identifier of each vertex of the target area based on the second identifiers of the plurality of candidate areas, all the first identifiers, and the first mapping relationship;
and the processing module is used for determining a target graph based on the target area and the first identification of each vertex of the target area.
According to another aspect of the present application, there is provided an electronic apparatus including:
at least one processor; and
A memory communicatively coupled to the at least one processor; wherein,
The memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of the preceding claims.
According to another aspect of the present application, there is provided a non-transitory computer-readable storage medium storing computer instructions for causing the computer to perform the method of any one of the above.
According to another aspect of the application, there is provided a computer program product comprising a computer program which, when executed by a processor, implements the method of any of the above.
It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the application or to delineate the scope of the application. Other features of the present application will become apparent from the description that follows.
Drawings
The above, as well as additional purposes, features, and advantages of exemplary embodiments of the present application will become readily apparent from the following detailed description when read in conjunction with the accompanying drawings. Several embodiments of the present application are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:
In the drawings, the same or corresponding reference numerals indicate the same or corresponding parts.
FIG. 1 illustrates a flow chart of a method of determining a target graphic according to one embodiment of the application;
FIG. 2 shows a schematic diagram of a graph according to one embodiment of the application;
FIG. 3 shows a schematic diagram of a target group of graphics according to one embodiment of the application;
FIG. 4 shows a schematic diagram of a target group of graphics according to another embodiment of the application;
FIG. 5 shows a flow chart of a method of determining a target graphic according to another embodiment of the application;
FIG. 6 shows a schematic diagram of a target group of graphics according to another embodiment of the application;
FIG. 7A shows a schematic diagram of a target group of graphics according to another embodiment of the application;
FIG. 7B shows a schematic diagram of a target group of graphics according to another embodiment of the application;
FIG. 8 shows a schematic diagram of a target group of graphics according to another embodiment of the application;
FIG. 9 shows a flow chart of a method of determining a target graphic according to another embodiment of the application;
FIG. 10 shows a schematic diagram of a graph according to another embodiment of the application;
FIG. 11 shows a flow chart of a method of determining a target graphic according to another embodiment of the application;
FIG. 12 shows a schematic diagram of a target area according to one embodiment of the application;
FIG. 13 shows a schematic view of a target area according to another embodiment of the application;
FIG. 14 is a schematic diagram showing the structure of a target pattern determining apparatus according to an embodiment of the present application;
fig. 15 is a schematic view showing a constitution of an electronic device according to an embodiment of the present application.
Detailed Description
In order to make the objects, features and advantages of the present application more comprehensible, the technical solutions according to the embodiments of the present application will be clearly described in the following with reference to the accompanying drawings, and it is obvious that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
In order to reduce the operation time of performing boolean operation on a graph and further improve the efficiency of extracting parasitic parameters from a layout, an embodiment of the present application provides a method for determining a target graph, as shown in fig. 1, where the method includes:
Step 101, a target graph group is obtained, a plurality of candidate areas and second identifications of the candidate areas are determined based on first identifications of a plurality of vertexes in the target graph group, the target graph group comprises two graphs respectively belonging to different layers in a layout and first identifications of each vertex in the graphs, the first identifications indicate graph state changes of areas where the vertexes are located, and the second identifications represent the number of graphs of the candidate areas.
The target graph group comprises two graphs respectively belonging to different layers in the layout, and the target graph group also comprises a first mark of each vertex in each graph. The layout comprises a plurality of layers, each layer is a Manhattan graph set, the Manhattan graph set refers to a set of integrated circuit graphs designed in a Manhattan wiring mode, and data of all layers in the layout are built based on the same Cartesian coordinates.
The first identifier indicates a change in graphics state of the corresponding vertex correspondence area. In an embodiment, the first marker identification includes a graphical state change indicating a lower right corner region of the vertex, or a graphical state change of an upper right corner region of the vertex. In another embodiment, the first identification comprises a graphical state change indicating a lower left corner region of the vertex, or a graphical state change of an upper left corner region of the vertex. For example, as shown in fig. 2, a graph is shown in fig. 2, where the first symbol corresponding to the vertex a of the graph in fig. 2 is U, which indicates that there is no graph in the lower right corner region of the vertex a, and that there is a graph in the upper right corner region of the vertex a, that is, indicates that the number of graphs increases by one from the lower right corner region to the upper right corner region of the vertex a. The first symbol corresponding to vertex B in fig. 2 is denoted as D, and represents that there is a pattern in the lower right corner region of vertex B, and that there is no pattern in the upper right corner region of vertex B, i.e., represents that the number of patterns decreases by one from the lower right corner region to the upper right corner region of vertex B. In fig. 2, the first identifiers corresponding to the vertex C and the vertex E are both N, which indicates that the graphics (vertex C) exist in both the upper right corner area and the lower right corner area of the corresponding vertex, or that the graphics (vertex E) do not exist in both the upper right corner area and the lower right corner area of the corresponding vertex, that is, that the number of the graphics is unchanged from the upper right corner area to the upper right corner area of the vertex C or the vertex E.
The target pattern group is characterized in terms of data, such as the target pattern group shown in fig. 3, which is composed of a pattern a and a pattern B, coordinates are given to each vertex in the pattern a and the pattern B based on the vertex positions of the pattern a and the pattern B, and the pattern a and the pattern B are represented in terms of coordinates. And determining a first identification of each vertex. The data for the target graphic group shown in fig. 3 is shown in table 1:
Ordinate of the ordinate (Abscissa, first sign)
0 (0，U)，(2，N)
1 (0，D)，(1，N)，(2，U)，(3，N)
2 (0，U)，(1，N)，(2，D)，(3，N)
3 (0，D)，(2，N)
TABLE 1
Where, when the ordinate shown in fig. 3 is 0, there are 2 vertices in the graph a, 0 vertices in the graph B are (0, 0) and (2, 0), respectively, and the first label corresponding to the vertex (0, 0) is U, the display form in table1 is (0,U) when the ordinate is 0. The first label corresponding to vertex (2, 0) is N, then the representation in table1 is (2, N) with an ordinate of 0. All vertices of graph a and graph B are represented with data in the form described above for subsequent storage and computation.
It should be noted that obtaining the set of target graphics may also be accomplished by any means that can be assigned vertex coordinates and labels.
A plurality of candidate regions and a second identification of the candidate regions are determined based on the first identifications of the plurality of vertices in the target graphics group. The candidate region is a region obtained by dividing the target graphics group in a specific direction based on a plurality of vertices.
In this embodiment, the second identifier is set to Z, O or T, the second identifier is that Z represents the number of graphics of the corresponding candidate region is 0, the second identifier is that O represents the number of graphics of the corresponding candidate region is 1, and the second identifier is that T represents the number of graphics of the corresponding candidate region is 2.
In other embodiments, the second identifier may be provided in the form of any number of graphics that may characterize the corresponding candidate region. For example, the second flag is set to A, B, C, the second flag is a to indicate that the number of graphics of the corresponding candidate region is 0, the second flag is B to indicate that the number of graphics of the corresponding candidate region is 1, and the second flag is C to indicate that the number of graphics of the corresponding candidate region is 2.
First, it is necessary to divide the target graphics group based on the vertices of the target graphics group, and as shown in fig. 4, the target graphics group is divided into a plurality of candidate regions according to the ordinate of the vertices. Of course, the target graphic component may be divided into a plurality of candidate regions according to the abscissa of the vertex, and may be specifically set based on requirements.
After determining the plurality of candidate regions, a second identification of the candidate regions is determined based on the first identifications of the plurality of vertices in the target graphics group. The second identifier comprises at least one element, and the element in the second identifier is used for representing the number of graphs of each interval in the candidate area to which the second identifier belongs.
Since the bottom region of the first candidate region is outside the target graphics group, the second identifier of the bottom region may be determined to be Z, and then the second identifier of the bottom region may be updated based on the vertex at the top of the bottom region, to obtain the second identifier of the first candidate region. And updating the second identifier of the first candidate region based on the first identifier of the vertex at the top of the first candidate region to obtain the second identifier of the second candidate region. And so on until the second identifications of all candidate regions are determined.
For example, as shown in FIG. 4, the target graphic group in FIG. 4 is divided into、、These 3 candidate regions. /(I)The region is outside the target group of graphics, thusThe second identity of the region may be determined as Z. Then based onThe vertex at the top of the region (i.e.All vertices of (a))pairUpdating the second identification of the region to obtainThe second identity of the candidate region is [ (0,O), (2, Z) ], characterizingIn the candidate region ofThere is no pattern,There are 1 graph,No graphics are present. Then based onThe vertex at the top of the candidate region (i.e.All vertices of (a))pairUpdating the second identifier of the candidate region to obtainAnd a second identification of the candidate region. Based onThe vertex at the top of the candidate region (i.e.All vertices of (a))pairUpdating the second identification of the candidate region to obtainAnd a second identification of the candidate region.
Step 102, determining a target area and a first mark of each vertex of the target area based on the second marks of the candidate areas, all the first marks and the first mapping relation.
A target region is determined based on the second identifications of the plurality of candidate regions.
For example, the target graphics group includes graphics a AND graphics B, AND the current boolean operation expression is aand B, AND the target region is the overlapping region of graphics a AND graphics B in the target graphics group. Then the second identified region as T is the target region. As shown in FIG. 4, in FIG. 4The second identifier of the candidate region is [ (0,O), (1, T), (2, o), (3, z) ], AND the current boolean operation formula is aand B, then the second identifier of the candidate region is required to be determined as the region of T, based onA second identification of the candidate region may be obtainedIn candidate regionThe second identification of the partial region is T, the partial region is determined as the target region. Of course, it is also necessary to determine, based on the second identifiers of all other candidate regions, a region with a second identifier of T in each candidate region, and a set of regions with a second identifier of T in all candidate regions, that is, the target region.
For another example, the target graphics group includes graphics a and graphics B, and the current boolean operation expression is aorb, and the target region is a region of the target graphics group other than the overlapping region of the two graphics. Then the second identified region as O is the target region.
For another example, the target graphics group includes graphics a and graphics B, and the current boolean operation formula is a NOT B, and the target region is a region of the target graphics group other than graphics B. Then the region within graphic a and identified second as O is the target region.
After the target area is determined, a first identification of each vertex in the target area is determined based on the first identifications of the plurality of vertices of the target area, the second identifications of the lower right corner areas of each vertex, and the first mapping relationship. The first mapping relationship indicates a mapping relationship between the second identifier of the candidate region and the first identifier of the vertex in the target region (i.e., the first identifier of the vertex in the corresponding target region may be determined from the first mapping relationship by the second identifier of the candidate region and the first identifier of the vertex in the candidate region). The first mapping relationship is related to a current boolean operator of the target graphic group. If the current boolean operator for the target graphic group is an AND, the first mapping is shown in table 2. If the current boolean operator of the target graphic group is OR, the first mapping is as shown in Table 3. If the current boolean operator of the target graphic group is NOT and the object of the boolean operator is the first graphic in the target graphic group, the first mapping relationship is shown in table 4. If the current boolean operator of the target graphic group is NOT and the object of the boolean operator is the second graphic in the target graphic group, the first mapping relationship is shown in table 5. Since the boolean operation is performed on two patterns, the number of patterns is only three, namely 0,1 and 2, and when the number of patterns is 0, it is impossible to change to-1, and when the number of patterns is 2, it is impossible to change to 3, and therefore, there are cases where the values in tables 2, 3, 4 and 5 are empty, that is, there are no cases.
For example, as shown in fig. 4, if the current boolean operation formula is aand B, then the target region of the target graphics group of fig. 4 has (1, 1), (2, 1), (1, 2), AND (2, 2) 4 vertices, where a first label for vertex (1, 1) is U AND a second label for the lower right corner region of vertex (1, 1) is O, AND then the first label for vertex (1, 1) in the target region is U as shown in the third row AND the second column in table 2 based on the first mapping relationship shown in table 2. The first label of the vertex (2, 1) is U, the second label of the right lower corner area of the vertex (2, 1) is Z, and then the first label of the vertex (2, 1) in the target area is N shown in the second row and the second column in the table 2 based on the first mapping relation shown in the table 2. The first label of the vertex (1, 2) is D, the second label of the right lower corner area of the vertex (1, 2) is T, and then the first label of the vertex (1, 2) in the target area is D shown in the fourth row and the third column in table 2 based on the first mapping relation shown in table 2. The first label of the vertex (2, 2) is N, the second label of the right lower corner area of the vertex (2, 2) is O, and then based on the first mapping relation shown in table 2, the first label of the vertex (2, 2) in the target area is N shown in the third row and the third column in table 2.
TABLE 2
TABLE 3 Table 3
TABLE 4 Table 4
TABLE 5
Step 103, determining a target graph based on the target area and the first identification of each vertex of the target area.
And determining the connection relation between the vertexes based on the coordinates of all vertexes of the target area, and determining the target graph based on the mapping relation between the current coordinates of the vertexes and the real coordinates of the vertexes in the layout.
In the above scheme, the first identification of each vertex in two graphics in the target graphics group is obtained. Since the first identifier indicates a graphics change of the region where the vertex is located, a plurality of candidate regions of the target graphics group and a second identifier of each candidate region can be determined based on the first identifier of the vertex. The second identifier characterizes the number of graphics of the candidate region, and thus the target region can be determined based on the second identifier, and further the first identifier of each vertex of the target region in the target region can be determined based on the first identifier of each vertex of the target region and the second identifier of the corresponding candidate region. And finally, determining the target graph based on the target area and the first mark of each vertex of the target area. In the method, the graph before operation and the target graph obtained after operation are both represented by the coordinates and the first mark of the vertex, so that the graph is easier to store and operate. And the operation difficulty is remarkably reduced and the efficiency of performing Boolean operation on the graph is improved by converting the operation of the graph into the operation between the first identifier and the second identifier.
In an example of the present application, as shown in fig. 5, there is further provided a method for determining a target graph, where determining a plurality of candidate regions and a second identifier of the candidate regions based on first identifiers of a plurality of vertices in the target graph group includes:
step 201, dividing the target graph group in a first preset direction based on the plurality of vertices to obtain a plurality of candidate areas.
For example, as shown in fig. 4, the first preset direction is set as the vertical direction, and the target graphic group is divided into based on the positions of the vertices in the first preset direction、、These 3 candidate regions.
Step 202, determining a second identification of the candidate region based on the first identification of the vertex of the candidate region and the second mapping relation.
The second mapping relationship indicates a mapping relationship between the second identifier of the previous candidate region and the first identifier of the vertex in the previous candidate region in the first preset direction and the second identifier of the next candidate region (i.e., the second identifier of the next candidate region can be determined from the second mapping relationship by the second identifier of the previous candidate region and the first identifier of the vertex in the previous candidate region in the first preset direction). In this embodiment, the second mapping relationship is shown in table 6:
TABLE 6
A second identification of the candidate region is determined based on the first identification of the vertex of the candidate region and the second mapping relationship.
Since the lower region of the first candidate region is outside the target graphics group, the second identifier of the lower region can be determined to be Z, and then the second identifier of the lower region can be updated based on the vertex at the top of the lower region and the second mapping relationship, so as to obtain the second identifier of the first candidate region. After the second identification of the first candidate region is obtained. And updating the second identifier of the first candidate region based on the first identifier of the top vertex of the first candidate region and the second mapping relation to obtain the second identifier of the second candidate region. And so on until the second identifications of all candidate regions are determined.
In the above-described aspect, the target graphics group is divided into a plurality of candidate regions in the first preset direction, and the second identifier of the candidate region is determined based on the first identifier of the vertex of the candidate region and the second mapping relation, so that the target region can be determined based on the second identifier.
In an example of the present application, there is further provided a method for determining a target graph, where determining a second identifier of the candidate region based on a first identifier of a vertex of the candidate region and a second mapping relationship includes:
updating the second identifier of the t candidate region based on the first identifier of the vertex in the t candidate region and the second mapping relation in the first preset direction to obtain the second identifier of the t+1st candidate region, wherein t is a positive integer.
For example, as shown in FIG. 4, in FIG. 3The region is outside the target group of graphics, thusThe second identity of the region may be determined as Z. Then based onThe vertex at the top of the region (i.e.All vertices of (a))pairUpdating the second identification of the region to obtainThe second identity of the candidate region is [ (0,O), (2, Z) ], characterizingIn the candidate region ofThere is no pattern,There are 1 graph,No graphics are present. Then based onThe vertex at the top of the candidate region (i.e., vertex (1, 1) and vertex (3, 1)) and the second mapping relation pairUpdating the second identity of the candidate region, in particularIn candidate regionPart does not have vertices and need not be updated, soIn candidate regionThe second identification of the part is also O. Based on the first identifier U and the second mapping relation of the vertex (1, 1), pairIn candidate regionUpdating the part of the second identification to obtainIn candidate regionThe second identity of the part is T,The second mark of the part is O. Based on the first label N and the second mapping relation of the vertex (3, 1), pairIn candidate regionUpdating the part of the second identification to obtainIn candidate regionThe second label of the section is Z. After updating, getThe second designation of candidate regions is [ (0,O), (1, t), (2, o), (3, z) ].
ObtainingAfter the second identification of the candidate region. Based onVertex at the top of candidate region (i.e., vertex (0, 2) and vertex (2, 2)) and second mapping pairThe second identification of the candidate region is updated. Specifically, the first mark D and the second mapping relation based on the vertex (0, 2), pairIn candidate regionUpdating the part of the second identification to obtainIn candidate regionSecond sign Z of partIn candidate regionUpdating the part of the second identification to obtainIn the candidate regionPart of the second label O. Based on the first label N and the second mapping relation of the vertex (2, 2), pairIn candidate regionUpdating the part of the second identification to obtainIn candidate regionSecond designation of part O, pairIn candidate regionUpdating part of the second identifier to obtainIn candidate regionThe second identification Z of the part. After updating, getThe second identity of the candidate region [ (1,O), (3, z) ].
In an example of the present application, there is also provided a method for determining a target pattern, the method further comprising:
The target region is determined based on boolean operators of the target graphic group.
The boolean operators of the target graph group may be AND, OR NOT, AND the target regions are different if the boolean operators of the target graph group are different.
In an example of the present application, there is further provided a method for determining a target graphic, where the determining the target area based on boolean operators of the target graphic group includes:
and if the Boolean operator of the target graph group is the first operator, determining the target area as the overlapping area of two graphs in the target graph group.
The first operator is AND, AND if the Boolean operator of the target graph group is AND, the target region is the overlapping region of two graphs in the target graph group.
As shown in fig. 6, the boolean operation expression of the target pattern group is aand B, i.e., it is necessary to perform an AND boolean operation on pattern a AND pattern B in the target pattern group in fig. 6. Then the target area is the overlapping area of pattern a and pattern B, i.e., the shaded portion in fig. 6.
And if the Boolean operator of the target graph group is a second operator, determining the target region as a region except the target graph in the target graph group.
If the Boolean operator of the target graph group is NOT, the target region is a region of the target graph group except the designated graph.
The designated graph is determined based on the boolean operation formulas of the target graph group. The second operator is NOT.
As shown in fig. 7A, if the boolean operation expression of the target graphics group is NOT a, the designated graphics are graphics a, and the target region is a region other than graphics a in the target graphics group, i.e., a hatched portion in fig. 7A.
Or as shown in fig. 7B, if the boolean operation expression of the target graphics group is NOT B, the graphics are designated as graphics B, and the target region is a region other than graphics B in the target graphics group, i.e., a hatched portion in fig. 7B.
And if the Boolean operator of the target graph group is a third operator, determining the target region as a region except the overlapping region in the target graph group.
The third operator is OR. If the Boolean operator of the target graphic group is OR, the target region is a region of the target graphic group other than the overlapping region.
As shown in fig. 8, the boolean operation formula of the target graphics group is aorb, that is, it is necessary to perform an OR boolean operation on graphics a and B in the target graphics group in fig. 6. The target area is an area in the target graphic group other than the overlapping area of the graphic a and the graphic B, i.e., a hatched portion in fig. 8.
In an example of the present application, there is further provided a method for determining a target pattern, as shown in fig. 9, the method further including:
step 301, a first starting vertex is determined from all vertices of the graph.
The graph is represented in the layer of the layout in the form of the real coordinates of each vertex in the layout or the real coordinates of each side (the real coordinates of the sides can be converted to the real coordinates of the vertices based on the operation), as shown in fig. 10, fig. 10 shows a certain graph, and the real coordinates of each vertex in the layout in the graph are shown in table 7.
TABLE 7
In the present embodiment, the bottom left-most vertex of the graph is determined as the first start vertex. In other embodiments, the first starting vertex may select any one vertex in the graph.
As shown in fig. 10, the vertex a is determined as the first start vertex in fig. 10.
Step 302, traversing all the vertices of the graph from the first initial vertex according to a second preset direction.
In this embodiment, the second preset direction is set to be counterclockwise, that is, all vertices of the graph are traversed in the counterclockwise direction from the first starting vertex. In other embodiments, the second preset direction may be set based on specific requirements.
Step 303, determining a first direction of the current vertex based on the coordinates of the current vertex and the previous vertex, and determining a second direction of the current vertex based on the coordinates of the current vertex and the next vertex.
Step 304, a first identification of the current vertex is determined based on the first direction and the second direction of the current vertex.
There are four directions:
First, the apex At the vertexTo the left in the horizontal direction of (a) is required to satisfyAnd。
Second, the vertexAt the vertexOn the right side in the horizontal direction of (a) is required to satisfyAnd。
Third, the vertexAt the vertexIs required to satisfyAnd。
Fourth, the vertexAt the vertexIs required to satisfyAnd。
Wherein,Is vertexIs,Is vertexOrdinate of/(I)Is vertexIs,Is vertexIs defined by the vertical coordinate of (c).
When meeting the vertexAt the vertexLeft side in horizontal direction (i.e., first direction) and vertexAt the vertexUpper in the vertical direction (i.e., the second direction), then the vertex/>, is determinedIs identified as U.
When meeting the vertexAt the vertexUpper in the vertical direction (i.e., the first direction) and vertexAt the vertexRight side in the horizontal direction (i.e., the second direction), then the vertex/>, is determinedIs identified as D.
When meeting the vertexAt the vertexRight side in the horizontal direction (i.e., first direction) and vertexAt the vertexIn the vertical direction (i.e., the second direction), or satisfies the vertexAt the vertexVertically below (i.e., the first direction) and at the vertexAt the vertexLeft side in the horizontal direction (i.e., second direction), then vertex/>, is determinedIs identified as N.
The first direction of the current vertex in the previous vertex is determined based on the coordinates of the current vertex and the previous vertex, and the second direction of the next vertex in the current vertex is determined based on the coordinates of the current vertex and the next vertex.
For example, as shown in fig. 10, if the current vertex is a vertex a, the previous vertex is a vertex L, the next vertex is a vertex B, and based on table 7, the coordinates of the vertex a are obtained as (290, 930), the coordinates of the vertex B are obtained as (290, 2050), and the coordinates of the vertex L are obtained as (750, 930). The upper side of the vertex B in the vertical direction of the vertex a may be determined based on the coordinates of the vertex a and the vertex B, and the left side of the vertex a in the horizontal direction of the vertex L may be determined based on the coordinates of the vertex a and the vertex L, and thus, the first flag of the vertex a is determined as U.
It should be noted that, the above method for determining the first direction and the second direction and the method for determining the first identifier based on the first direction and the second direction are both based on the setting when the second preset direction is the clockwise direction, and if the second preset direction is set to be other directions, adaptive adjustment is required.
And step 305, after the traversing is completed, obtaining a first mark of each vertex in the graph.
After traversing all the vertexes of the graph, obtaining a first mark of each vertex in the graph.
In the above-mentioned scheme, since the first identifier of each vertex has a correlation with the directions of the previous vertex and the next vertex of the vertex, the directions can be determined by the coordinates of each vertex, the previous vertex of the vertex, and the next vertex of the vertex, and then the first identifier of each vertex can be determined based on the directions.
In an example of the present application, there is further provided a method for determining a target graph, where the determining a target graph based on a target region and a first identifier of each vertex of the target region, as shown in fig. 11, includes:
and step 401, grouping all vertexes of the target area according to the ordinate, and obtaining a plurality of vertex coordinate groups.
The target area is actually represented in coordinates of all vertices. And grouping all vertexes of the target area according to the ordinate to obtain a plurality of vertex coordinate groups.
For example, as shown in fig. 12, the target area is represented by coordinates of a plurality of vertices in table 8, and the plurality of vertices in table 8 are each grouped by an ordinate. Whereas there is no connection between the vertices of the target area in fig. 12, the dashed line in fig. 12 does not actually exist, and is only used herein to show the shape of the target area.
TABLE 8
Step 402, connecting vertices with serial numbers of 2i and 2i+1 in the vertex coordinate set, wherein i is a natural number.
Namely, the vertices with serial numbers of 0 and 1, 2 and 3, 4 and 5 in each vertex coordinate set are connected, the subsequent serial numbers are similar.
For example, as shown in fig. 13, the target area after the vertices in table 8 are processed in step 402, the vertices with numbers 0 and 1 in the vertex coordinate set with the ordinate 0 are connected, the vertices with numbers 0 and 1 in the vertex coordinate set with the ordinate 1 are connected, and the vertices with numbers 0 and 1 in the vertex coordinate set with the ordinate 1 are connected.
Step 403, creating a vertex buffer sequence, determining a second initial vertex, and traversing all vertices according to a third preset direction from the second initial vertex.
In this embodiment, the second initial vertex selects a vertex with the smallest ordinate and abscissa, and the third preset direction is set to traverse the vertices in the vertex coordinate set where the current vertex is located according to ascending order of the abscissa. If the current vertex is the vertex with the largest abscissa in the vertex coordinate set where the current vertex is located, traversing the next vertex coordinate set is started, and the traversing sequence is still traversing in the ascending order of the abscissa.
Step 404, if there is a vertex whose abscissa is the same as that of the current vertex in the vertex cache sequence, connecting the current vertex with the vertex, and removing the vertex from the vertex cache sequence.
And step 405, if no vertex with the same abscissa as the current vertex exists in the vertex cache sequence, adding the current vertex into the vertex cache sequence.
And step 406, after the traversing is completed, obtaining the target graph.
For example, as for the vertex in table 8, the coordinates of the second starting vertex are (0, 0), and the traversal starts from the second starting vertex, at which point the vertex buffer sequence is empty, and there is no vertex whose abscissa is the same as that of the vertex (0, 0), so the vertex (0, 0) is added to the vertex buffer sequence. Then traversing to vertex (1, 0), the vertex cache sequence is again free of vertices that are the same as the abscissa of vertex (1, 0), thus adding vertex (1, 0) to the vertex cache sequence. Then traversing to the vertex (1, 1), wherein the vertex (1, 0) exists in the vertex cache sequence, and the vertex (1, 0) is identical to the abscissa of the vertex (1, 1), so that the vertex (1, 0) is connected with the vertex (1, 1), and the vertex (1, 0) is removed from the vertex cache sequence. Subsequent operations and so on. After the traversal is completed, the target graph of the target area represented by the vertex in table 8 can be obtained.
It should be noted that, the coordinates of each vertex of the target graph need to be converted based on the mapping relationship between the real coordinates of the vertex in the layout and the coordinates established based on the vertex position, so as to convert the coordinates of each vertex of the target graph into the real coordinates in the layout.
In order to achieve the above-described target graphic determining method, as shown in fig. 14, an example of the present application provides a target graphic determining apparatus, including:
A calculation module 10, configured to obtain a target graph group, and determine a plurality of candidate regions and second identifiers of the candidate regions based on first identifiers of a plurality of vertices in the target graph group, where the target graph group includes two graphs respectively belonging to different layers in a layout and a first identifier of each vertex in the graphs, the first identifier indicates a graph state change of a region where the vertex is located, and the second identifier indicates a graph number of the candidate regions;
The computing module 10 is further configured to determine a target area and a first identifier of each vertex of the target area based on the second identifiers of the plurality of candidate areas, all the first identifiers, and the first mapping relationship;
a processing module 20 is configured to determine a target graph based on the target region and the first identification of each vertex of the target region.
The processing module 20 is further configured to divide the target graphics group in a first preset direction based on the multiple vertices to obtain multiple candidate areas;
The computing module 10 is further configured to determine a second identifier of the candidate region based on the first identifier of the vertex of the candidate region and the second mapping relationship.
The computing module 10 is further configured to update the second identifier of the t candidate region based on the first identifier of the vertex in the t candidate region and the second mapping relationship in the first preset direction, so as to obtain the second identifier of the t+1st candidate region, where t is a positive integer.
Wherein the computing module 10 is further configured to determine the target region based on a boolean operator of the target graphic group.
The computing module 10 is further configured to determine that the target area is an overlapping area of two graphics in the target graphics group if the boolean operator of the target graphics group is a first operator;
The computing module 10 is further configured to determine that the target area is an area of the target graphics group other than the designated graphics if the boolean operator of the target graphics group is a second operator;
The computing module 10 is further configured to determine that the target region is a region of the target graphics group other than the overlapping region if the boolean operator of the target graphics group is a third operator.
Wherein the computing module 10 is further configured to determine a first initial vertex from all vertices of the graph;
The computing module 10 is further configured to traverse all vertices of the graph from the first starting vertex according to a second preset direction;
The computing module 10 is further configured to determine a first direction of the current vertex based on coordinates of the current vertex and a previous vertex, and determine a second direction of the current vertex based on coordinates of the current vertex and a next vertex;
the computing module 10 is further configured to determine a first identifier of the current vertex based on the first direction and the second direction of the current vertex;
the computing module 10 is further configured to obtain a first identifier of each vertex in the graph after the traversing is completed.
The processing module 20 is further configured to group all vertices of the target area according to ordinate, so as to obtain a plurality of vertex coordinate sets;
the processing module 20 is further configured to connect vertices with serial numbers of 2i and 2i+1 in the vertex coordinate set, where i is a natural number;
the processing module 20 is further configured to create a vertex buffer sequence, determine a second initial vertex, and traverse all vertices from the second initial vertex according to a third preset direction;
The processing module 20 is further configured to connect the current vertex with the vertex if the vertex cache sequence has a vertex whose abscissa is the same as the current vertex, and remove the vertex from the vertex cache sequence;
The processing module 20 is further configured to add the current vertex to the vertex cache sequence if there is no vertex in the vertex cache sequence whose abscissa is the same as the current vertex abscissa;
the processing module 20 is further configured to obtain the target graph after the traversing is completed.
According to embodiments of the present disclosure, the present disclosure also provides an electronic device and a readable storage medium.
Fig. 15 illustrates a schematic block diagram of an example electronic device 500 that may be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the disclosure described and/or claimed herein.
As shown in fig. 15, the apparatus 500 includes a computing unit 501 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM) 502 or a computer program loaded from a storage unit 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the device 500 can also be stored. The computing unit 501, ROM 502, and RAM 503 are connected to each other by a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
Various components in the device 500 are connected to the I/O interface 505, including: an input unit 506 such as a keyboard, a mouse, etc.; an output unit 507 such as various types of displays, speakers, and the like; a storage unit 508 such as a magnetic disk, an optical disk, or the like; and a communication unit 509 such as a network card, modem, wireless communication transceiver, etc. The communication unit 509 allows the device 500 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.
The computing unit 501 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 501 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The calculation unit 501 performs the respective methods and processes described above, for example, a determination method of a target graphic. For example, in some embodiments, the method of determining a target graphic may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as storage unit 508. In some embodiments, part or all of the computer program may be loaded and/or installed onto the device 500 via the ROM 502 and/or the communication unit 509. When the computer program is loaded into the RAM 503 and executed by the computing unit 501, one or more steps of the above-described target pattern determination method may be performed. Alternatively, in other embodiments, the computing unit 501 may be configured to perform the method of determining the target graphic by any other suitable means (e.g., by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), integrated Systems On Chip (SOCs), complex Programmable Logic Devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.
The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server may be a cloud server, a server of a distributed system, or a server incorporating a blockchain.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps recited in the present disclosure may be performed in parallel or sequentially or in a different order, provided that the desired results of the technical solutions of the present disclosure are achieved, and are not limited herein.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In the description of the present disclosure, the meaning of "a plurality" is two or more, unless explicitly defined otherwise.
The foregoing is merely specific embodiments of the disclosure, but the protection scope of the disclosure is not limited thereto, and any person skilled in the art can easily think about changes or substitutions within the technical scope of the disclosure, and it is intended to cover the scope of the disclosure. Therefore, the protection scope of the present disclosure shall be subject to the protection scope of the claims.

Claims (11)

1.A method of determining a target pattern, the method comprising:
Obtaining a target graph group, and determining a plurality of candidate areas and second identifications of the candidate areas based on first identifications of a plurality of vertexes in the target graph group, wherein the target graph group comprises two graphs respectively belonging to different layers in a layout and first identifications of each vertex in the graphs, the first identifications indicate the change of the number of the graphs of the area where the vertexes are located, and the second identifications represent the number of the graphs of the candidate areas;
determining a target area and a first mark of each vertex of the target area based on the second marks of the candidate areas, all the first marks and a first mapping relation;
determining connection relations among the vertexes based on coordinates of all vertexes of the target area;
And connecting all the vertexes of the target area based on the connection relation among the vertexes to obtain a target graph.
2. The method of claim 1, the determining a plurality of candidate regions and a second identification of the candidate regions based on first identifications of a plurality of vertices in the target graphics group, comprising:
Dividing the target graph group in a first preset direction based on the plurality of vertexes to obtain a plurality of candidate areas;
And determining a second identification of the candidate region based on the first identification of the vertex of the candidate region and the second mapping relation.
3. The method of claim 2, the determining the second identification of the candidate region based on the first identification of the vertex of the candidate region and the second mapping relationship, comprising:
updating the second identifier of the t candidate region based on the first identifier of the vertex in the t candidate region and the second mapping relation in the first preset direction to obtain the second identifier of the t+1st candidate region, wherein t is a positive integer.
4. The method of claim 1, the method further comprising:
The target region is determined based on boolean operators of the target graphic group.
5. The method of claim 4, the determining the target region based on boolean operators of the target graphic group comprising:
If the Boolean operator of the target graph group is a first operator, determining that the target area is an overlapping area of two graphs in the target graph group;
If the Boolean operator of the target graph group is a second operator, determining that the target region is a region except the designated graph in the target graph group;
And if the Boolean operator of the target graph group is a third operator, determining the target region as a region except the overlapping region in the target graph group.
6. The method of claim 1, the method further comprising:
Determining a first initial vertex from all vertices of the graph;
traversing all vertexes of the graph from the first initial vertex according to a second preset direction;
Determining a first direction of the current vertex based on the coordinates of the current vertex and the previous vertex, and determining a second direction of the current vertex based on the coordinates of the current vertex and the next vertex;
determining a first identification of the current vertex based on the first direction and the second direction of the current vertex;
and after the traversing is completed, obtaining a first mark of each vertex in the graph.
7. The method of claim 1, the determining a target graph based on a target region and a first identification of each vertex of the target region, comprising:
grouping all vertexes of the target area according to ordinate to obtain a plurality of vertex coordinate groups;
Connecting vertexes with serial numbers of 2i and 2i+1 in the vertex coordinate set, wherein i is a natural number;
Creating a vertex cache sequence, determining a second initial vertex, and traversing all vertices from the second initial vertex according to a third preset direction;
If the vertex cache sequence has a vertex with the same abscissa as the current vertex, connecting the current vertex with the vertex, and removing the vertex from the vertex cache sequence;
if no vertex with the abscissa identical to the abscissa of the current vertex exists in the vertex cache sequence, adding the current vertex into the vertex cache sequence;
And after the traversing is completed, obtaining the target graph.
8. A target pattern determination apparatus, the apparatus comprising:
The computing module is used for obtaining a target graph group and determining a plurality of candidate areas and second identifications of the candidate areas based on first identifications of a plurality of vertexes in the target graph group, wherein the target graph group comprises two graphs respectively belonging to different layers in a layout and first identifications of each vertex in the graphs, the first identifications indicate the change of the number of the graphs of the area where the vertexes are located, and the second identifications represent the number of the graphs of the candidate areas;
The computing module is further configured to determine a target area and a first identifier of each vertex of the target area based on the second identifiers of the plurality of candidate areas, all the first identifiers, and the first mapping relationship;
The processing module is used for determining the connection relation between the vertexes based on the coordinates of all vertexes of the target area;
And the processing module is also used for connecting all the vertexes of the target area based on the connection relation among the vertexes to obtain a target graph.
9. An electronic device, comprising:
at least one processor; and
A memory communicatively coupled to the at least one processor; wherein,
The memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-7.
10. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of any one of claims 1-7.
11. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any of claims 1-7.
CN202410046422.6A 2024-01-12 2024-01-12 Target pattern determining method and device, electronic equipment and storage medium Active CN117556781B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202410046422.6A CN117556781B (en) 2024-01-12 2024-01-12 Target pattern determining method and device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202410046422.6A CN117556781B (en) 2024-01-12 2024-01-12 Target pattern determining method and device, electronic equipment and storage medium

Publications (2)

Publication Number Publication Date
CN117556781A CN117556781A (en) 2024-02-13
CN117556781B true CN117556781B (en) 2024-05-24

Family

ID=89820930

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202410046422.6A Active CN117556781B (en) 2024-01-12 2024-01-12 Target pattern determining method and device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN117556781B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113723090A (en) * 2021-03-12 2021-11-30 京东城市(北京)数字科技有限公司 Position data acquisition method and device, electronic equipment and storage medium
CN114297739A (en) * 2021-12-27 2022-04-08 北京华大九天科技股份有限公司 Identification processing method and device for layout verification, server and storage medium
CN116311526A (en) * 2023-03-22 2023-06-23 深圳市星桐科技有限公司 Image area determining method and device, electronic equipment and storage medium
WO2023173727A1 (en) * 2022-03-16 2023-09-21 北京字跳网络技术有限公司 Image processing method and apparatus, and electronic device
CN117292039A (en) * 2023-11-27 2023-12-26 芯瞳半导体技术(山东)有限公司 Vertex coordinate generation method, vertex coordinate generation device, electronic equipment and computer storage medium

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113723090A (en) * 2021-03-12 2021-11-30 京东城市(北京)数字科技有限公司 Position data acquisition method and device, electronic equipment and storage medium
CN114297739A (en) * 2021-12-27 2022-04-08 北京华大九天科技股份有限公司 Identification processing method and device for layout verification, server and storage medium
WO2023173727A1 (en) * 2022-03-16 2023-09-21 北京字跳网络技术有限公司 Image processing method and apparatus, and electronic device
CN116311526A (en) * 2023-03-22 2023-06-23 深圳市星桐科技有限公司 Image area determining method and device, electronic equipment and storage medium
CN117292039A (en) * 2023-11-27 2023-12-26 芯瞳半导体技术(山东)有限公司 Vertex coordinate generation method, vertex coordinate generation device, electronic equipment and computer storage medium

Also Published As

Publication number Publication date
CN117556781A (en) 2024-02-13

Similar Documents

Publication Publication Date Title
US11796670B2 (en) Radar point cloud data processing method and device, apparatus, and storage medium
CN113436233B (en) Registration method and device of automatic driving vehicle, electronic equipment and vehicle
CN112966330A (en) Wall surface generation method of crossed wall body, computer equipment and readable storage medium
CN116137077A (en) Method and device for establishing electronic component library, electronic equipment and storage medium
CN115797565A (en) Three-dimensional reconstruction model training method, three-dimensional reconstruction device and electronic equipment
CN117556781B (en) Target pattern determining method and device, electronic equipment and storage medium
CN115222879A (en) Model surface reduction processing method and device, electronic equipment and storage medium
CN116524165B (en) Migration method, migration device, migration equipment and migration storage medium for three-dimensional expression model
CN113205090A (en) Picture rectification method and device, electronic equipment and computer readable storage medium
CN113656529B (en) Road precision determination method and device and electronic equipment
CN113470145B (en) Map data processing method, device, equipment and storage medium
CN115374499A (en) Dimension marking method and device, electronic equipment and storage medium
CN114596196A (en) Method and device for filtering point cloud data, equipment and storage medium
CN114581586A (en) Method and device for generating model substrate, electronic equipment and storage medium
CN114723894A (en) Three-dimensional coordinate obtaining method and device and electronic equipment
CN115797585B (en) Parking lot map generation method and device
CN117151020B (en) Method and device for rapidly judging intersecting state of copper-clad shapes based on quadtree
CN114485716B (en) Lane rendering method and device, electronic equipment and storage medium
CN116151168B (en) Method, device, equipment and storage medium for determining equivalent conductor of grounding grid
CN113470143B (en) Electronic map drawing method, device, equipment and automatic driving vehicle
CN116721182A (en) Graphic surface constructing method, device, equipment and storage medium
JP2024150733A (en) Task execution method, device, equipment, and storage medium used for large-scale language models
CN118095465A (en) Method and device for describing quantum chip, electronic equipment and storage medium
CN116820041A (en) Comparison method, device, equipment and storage medium for controller control logic function
CN117953073A (en) Calibration parameter determining method and device for depth camera and electronic equipment

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
GR01 Patent grant
GR01 Patent grant