Geometric relationship judgment method and device for quickly identifying polygon intersection, equipment and storage medium

By reading geometric model parameters, establishing observation angles and reference planes, generating projection area areas, and judging the position relationship of polygons, the problem of slow processing speed of PCB board-level system models and difficult to judge edge alignment is solved, and efficient Geometric model processing and edge alignment judgment.

CN119205871APending Publication Date: 2024-12-27CHINA IND INTERNET RES INST
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411153576.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-21
Publication Date
2024-12-27

AI Technical Summary

Technical Problem

In the prior art, the geometric model of the multi-layer complex structure PCB board-level system model is slow to process and cannot effectively judge edge alignment.

Method used

By reading and storing all geometric parameter information in the geometric model, the observation angle is determined and a two-dimensional datum is established. The projected area area of ​​the polygon is generated based on the observation angle, and the positional relationship of these areas is judged to output the intersection results, including overlap, intersection, Inclusion and separation relationships.

Benefits of technology

The geometric model processing speed of multi-layer complex structure PCB board-level system models is significantly improved, and edge alignment can be effectively judged, calculation complexity is reduced, and the problem of inefficiency in traditional methods is solved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119205871A_ABST
    Figure CN119205871A_ABST
Patent Text Reader

Abstract

The invention discloses a geometric relationship judgment method, device and equipment for rapidly recognizing polygon intersection and a storage medium, and relates to the technical field of printed circuit board manufacturing, and the method comprises the steps: reading and storing all geometric parameter information in a geometric model; an observation view angle is determined, a two-dimensional reference surface is established based on the observation view angle and the geometric parameter information, and the two-dimensional reference surface and the observation view angle are in a one-to-one matching relation; determining a first polygon and a second polygon in a model structure, and generating a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation view angle; and judging the position relationship between the first projection area region and the second projection area region, and outputting a judgment result, thereby solving the problems that the geometric model processing speed of the multi-layer complex structure PCB board-level system model is relatively slow, and the side line alignment cannot be judged.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of printed circuit board manufacturing, and in particular to a method, device, equipment and storage medium for quickly identifying geometric relationships between polygon intersections. Background Art

[0002] With the rapid development of network technology and the continuous deepening of digital technology, the demand for PCB in many fields such as computers and servers has gradually evolved from high frequency and high speed to high stability and more complex functions. For complex multi-layer circuit system structures, simulation software needs to pre-process the geometric model of the circuit system structure, thereby providing the premise and basis for completing simulation modeling, discrete solution, and result analysis. However, with the increase of PCB board-level system circuit hierarchical structure and complex and small components in actual engineering, the internal geometric structure of the model shows a development trend of multi-dimensional, multi-level and many small structures. Based on the traditional method of bubble traversal, when dealing with such complex problems in actual engineering, although the algorithm programming is simple to implement, the overall solution efficiency and algorithm complexity when dealing with the problem will increase exponentially with the structural complexity of the model board-level circuit, which will undoubtedly lead to the use of traditional methods to consume a lot of time for the geometric relationship judgment and storage process of polygon intersection information in the geometric model. The efficiency and accuracy of the model geometry preprocessing process for geometric information processing are crucial to the simulation solution of the entire model. The time consumed in this process will directly affect the model processing cycle. The geometric model processing speed of the multi-layer complex structure PCB board-level system model is slow, and it is impossible to determine the alignment of the edge lines.

[0003] The above contents are only used to assist in understanding the technical solution of the present application and do not constitute an admission that the above contents are prior art. Summary of the invention

[0004] The main purpose of this application is to provide a method, device, equipment and storage medium for quickly identifying the geometric relationship judgment of polygon intersections, aiming to solve the technical problems in the prior art that the geometric model processing speed of multi-layer complex structure PCB board-level system model is slow and the edge alignment cannot be judged.

[0005] To achieve the above purpose, the present application proposes a method for quickly identifying the geometric relationship of polygon intersections, the method comprising:

[0006] Read and store all geometric parameter information in the geometric model;

[0007] Determine an observation angle, and establish a two-dimensional reference plane based on the observation angle and the geometric parameter information, wherein the two-dimensional reference plane is in a one-to-one matching relationship with the observation angle;

[0008] Determine a first polygon and a second polygon in the model structure, and generate a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation angle;

[0009] The positional relationship between the first projection area region and the second projection area region is judged, and a judgment result is output.

[0010] In one embodiment, the step of determining the positional relationship between the first projection area region and the second projection area region and outputting the determination result comprises:

[0011] Performing an overlap judgment on the positional relationship between the first projection area region and the second projection area region;

[0012] When the positional relationship between the first projection area region and the second projection area region is an overlapping relationship, outputting a first judgment result;

[0013] When the positional relationship between the first projection area region and the second projection area region is not an overlapping relationship, a second determination result is outputted.

[0014] In one embodiment, when the positional relationship between the first projection area region and the second projection area region is an overlapping relationship, outputting the first judgment result includes:

[0015] When the positional relationship between the first projection area region and the second projection area region is an overlapping relationship, traversing a first edge set of the first polygon and a second edge set of the second polygon;

[0016] Performing an intersection test on a first edge in the first edge set and a second edge in the second edge set to obtain an intersection test result;

[0017] When the intersection detection result is an intersection, a first determination result that the first polygon and the second polygon intersect is output.

[0018] In one embodiment, after the step of performing an intersection test on the first edge in the first edge set and the second edge in the second edge set to obtain an intersection test result, the step further includes:

[0019] When the intersection detection result is no intersection, returning to the step of performing an intersection test on the first edge in the first edge set and the second edge in the second edge set to obtain an intersection detection result, until all edges in the first edge set and the second edge set are traversed;

[0020] After all edges in the first edge set and the second edge set are traversed, judging the intersection detection result;

[0021] When the intersection detection result is non-intersection, a first judgment result that the first polygon and the second polygon do not intersect is output.

[0022] In one embodiment, after the step of outputting a first judgment result that the first polygon and the second polygon do not intersect, the method further includes:

[0023] Determine an area relationship between the first projection area region and the second projection area region, and determine a large-area polygon and a small-area polygon according to the area relationship, wherein the area of ​​the projection area region of the large-area polygon is greater than the area of ​​the projection area region of the small-area polygon;

[0024] Determine the vertices of the small-area polygon;

[0025] Determine the positional relationship between the vertices of the small-area polygon and the large-area polygon;

[0026] When the positional relationship is that all vertices of the small-area polygon are located inside the large-area polygon, it is determined that the small-area polygon and the large-area polygon are in a containment relationship, and a first output result that the first polygon and the second polygon are completely contained is output.

[0027] In one embodiment, after the step of determining the positional relationship between the vertices of the small-area polygon and the large-area polygon, the method further includes:

[0028] When the positional relationship is that all vertices of the small-area polygon are located outside the large-area polygon, it is determined that the small-area polygon and the large-area polygon are in a separation relationship, and a first output result of separation of the first polygon and the second polygon is output.

[0029] In one embodiment, all geometric parameter information in the geometric model includes element structure information of each polygon in the collective model, including at least points, lines, and surfaces.

[0030] In addition, to achieve the above purpose, the present application also proposes a geometric relationship judgment device for quickly identifying the intersection of polygons, and the geometric relationship judgment device for quickly identifying the intersection of polygons includes:

[0031] An information reading module is used to read and store all geometric parameter information in the geometric model;

[0032] A reference plane generation module, used to determine an observation angle, and to establish a two-dimensional reference plane based on the observation angle and the geometric parameter information, wherein the two-dimensional reference plane is in a one-to-one matching relationship with the observation angle;

[0033] A model projection module, used to determine a first polygon and a second polygon in the model structure, and generate a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation angle;

[0034] The position identification module is used to determine the positional relationship between the first projection area region and the second projection area region, and output a determination result.

[0035] In addition, to achieve the above-mentioned purpose, the present application also proposes a geometric relationship judgment device for quickly identifying the intersection of polygons, the device comprising: a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program being configured to implement the steps of the geometric relationship judgment method for quickly identifying the intersection of polygons as described above.

[0036] In addition, to achieve the above-mentioned purpose, the present application also proposes a storage medium, which is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by the processor, the steps of the method for quickly identifying the geometric relationship judgment of polygon intersection as described above are implemented.

[0037] In addition, to achieve the above-mentioned purpose, the present application also provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, it implements the steps of the method for quickly identifying the geometric relationship judgment of polygon intersection as described above.

[0038] One or more technical solutions proposed in the present application have at least the following technical effects: reading and storing all geometric parameter information in the geometric model; determining the observation angle, and establishing a two-dimensional reference plane based on the observation angle and the geometric parameter information, and the two-dimensional reference plane is in a one-to-one matching relationship with the observation angle; determining the first polygon and the second polygon in the model structure, and generating a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation angle; judging the positional relationship between the first projection area region and the second projection area region, and outputting the judgment result, so as to solve the problem that the geometric model processing speed of the multi-layer complex structure PCB board-level system model is slow and the edge alignment cannot be judged. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0040] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0041] Figure 1 A flowchart diagram of a first embodiment of a method for quickly identifying the geometric relationship of polygon intersections provided by the present application;

[0042] Figure 2 A diagram showing the transformation process of the projection area of ​​a polygon P etc. on a reference plane S provided in an embodiment of a method for quickly identifying the geometric relationship of polygon intersections of the present application;

[0043] Figure 3 A schematic diagram of a simplified process of a method for quickly identifying a geometric relationship between polygons according to an embodiment of the present application;

[0044] Figure 4 A schematic diagram of the module structure of a geometric relationship determination device for quickly identifying polygon intersections according to an embodiment of the present application;

[0045] Figure 5 Schematic diagram of the device structure of the hardware operating environment involved in the method for quickly identifying the geometric relationship of polygon intersection in the embodiment of the present application.

[0046] The purpose, features and advantages of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0047] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of the present application and are not used to limit the present application.

[0048] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.

[0049] The main solution of the embodiment of the present application is: read and store all geometric parameter information in the geometric model; determine the observation angle, and establish a two-dimensional reference plane based on the observation angle and the geometric parameter information, and the two-dimensional reference plane has a one-to-one matching relationship with the observation angle; determine the first polygon and the second polygon in the model structure, and generate a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation angle; judge the positional relationship between the first projection area region and the second projection area region, and output the judgment result.

[0050] In this embodiment, for the convenience of description, the following description is made by taking the geometric relationship determination device for quickly identifying the intersection of polygons as the execution subject.

[0051] Since the existing technology is aimed at the identification and extraction of polygon intersection information in geometric preprocessing, the traditional method based on bubble traversal handles this problem by traversing each edge of the polygon on the same spatial dimension surface to complete the judgment of the geometric intersection state and the storage of the corresponding geometric information, and then repeats the above traversal test process for polygons of different levels in other dimensions of the overall geometric structure. The programming implementation process of this traditional method is simple and the theory is easy to understand, but with the increase of PCB board-level system circuit hierarchy structure and complex and small components in actual engineering, the internal model geometry structure presents a development trend of multi-dimensional, multi-level and many small structures. Based on the traditional method of bubble traversal, when dealing with such complex problems in actual engineering, although the algorithm programming implementation is simple, the overall solution efficiency and algorithm complexity will increase exponentially with the structural complexity of the model board-level circuit, which will undoubtedly lead to the use of traditional methods to consume a lot of time for the geometric relationship judgment and storage process of polygon intersection information in the geometric model. The efficiency and accuracy of the model geometry preprocessing process for geometric information processing are crucial to the simulation solution of the entire model, and the time consumed in this process will directly affect the cycle of model processing.

[0052] The present application provides a solution, which reads and stores all geometric parameter information in a geometric model; determines an observation angle, and establishes a two-dimensional reference plane based on the observation angle and the geometric parameter information, wherein the two-dimensional reference plane is in a one-to-one matching relationship with the observation angle; determines a first polygon and a second polygon in a model structure, and generates a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation angle; judges the positional relationship between the first projection area region and the second projection area region, and outputs a judgment result, so as to solve the problem that the geometric model processing speed of a multi-layer complex structure PCB board-level system model is slow and the edge alignment cannot be judged.

[0053] It can be seen from the above embodiments that the present application reads and stores all geometric parameter information in the geometric model; determines the observation angle, and establishes a two-dimensional reference plane based on the observation angle and the geometric parameter information, and the two-dimensional reference plane is in a one-to-one matching relationship with the observation angle; determines the first polygon and the second polygon in the model structure, and generates a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation angle; judges the positional relationship between the first projection area region and the second projection area region, and outputs the judgment result, so as to solve the problem that the geometric model processing speed of the multi-layer complex structure PCB board-level system model is slow and the edge alignment cannot be judged.

[0054] It should be noted that the execution subject of this embodiment can be a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or an electronic device capable of realizing the above functions, a geometric relationship judgment device for quickly identifying the intersection of polygons, etc. The following takes the geometric relationship judgment device for quickly identifying the intersection of polygons as an example to illustrate this embodiment and the following embodiments.

[0055] Based on this, the embodiment of the present application provides a method for quickly identifying the geometric relationship judgment of polygon intersections, referring to Figure 1 , Figure 1 This is a flow chart of the first embodiment of the geometric relationship determination method for quickly identifying polygon intersections in the present application.

[0056] In this embodiment, the method for quickly identifying the geometric relationship of polygon intersections includes steps S10 to S40:

[0057] Step S10, reading and storing all geometric parameter information in the geometric model.

[0058] It should be noted that the geometric model refers to the three-dimensional or multi-dimensional model of the PCB (Printed Circuit Board) board-level system circuit in the electronic circuit simulation software. These models describe in detail the various components, routing, hierarchical structure and other related physical features on the PCB board. The geometric model is the basis for circuit simulation, design verification and optimization.

[0059] It should be understood that geometric parameters are a series of data and attributes that constitute the geometric model. They define the specific size, shape and relative position of each element in the model. In PCB board-level system circuit design, geometric parameters include but are not limited to point, line, surface, and element structure information.

[0060] In the specific implementation, the geometric parameters in the geometric model include at least points, lines, surfaces, element structures and other elements, where points refer to the coordinates of the vertices of the polygon, which can be expressed in the form of (x, y, z); lines are straight lines or curves defined by two points, which can be straight lines or curved tracks; surfaces are planes or curved surfaces surrounded by multiple line segments or curves, which can be various layers of the PCB board; element structures include trace width, thickness, pad size and other component collection features. The geometric parameters of these geometric models are stored together with each geometric model, which is stored in a local or cloud database. Therefore, all geometric parameter information in the geometric model can be read and stored by local or cloud acquisition.

[0061] Step S20, determining an observation angle, and establishing a two-dimensional reference plane based on the observation angle and the geometric parameter information, wherein the two-dimensional reference plane is in a one-to-one matching relationship with the observation angle.

[0062] It should be noted that the observation perspective refers to the perspective adopted by the observer or analyst when analyzing the geometric model. In three-dimensional space, different observation perspectives can reveal different features and details of the model. In PCB board-level system circuit design, choosing an appropriate observation perspective helps to more clearly identify and analyze the geometric structure of the circuit board, such as routing, component layout, etc. The two-dimensional reference plane is a plane selected in three-dimensional space, which is used to project the three-dimensional geometric model into two-dimensional space for analysis.

[0063] In a specific implementation, the observation angle is determined by the operator, and observation can be performed from any observable angle. In this embodiment, the direction of the top-down angle can be selected, and a two-dimensional reference plane S is established in the direction of the top-down angle based on geometric parameters. There is a one-to-one matching relationship between the current two-dimensional reference plane S and the observation angle of the top-down angle. When the observation angle changes, the corresponding two-dimensional reference plane also changes.

[0064] Step S30, determining a first polygon and a second polygon in the model structure, and generating a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation viewing angle.

[0065] It should be noted that the first polygon and the second polygon are both polygons in the geometric model structure, wherein the first polygon can be determined as the selected polygon, and the second polygon is a polygon other than the currently selected polygon, and the projection area area refers to the plane area formed by projecting the polygons in the three-dimensional geometric model onto the two-dimensional reference plane. The projection area area corresponding to the first polygon is the first projection area area, and the projection area area corresponding to the second polygon is the second projection area area.

[0066] In a specific implementation, all polygons in the model structure can be selected, and the selected polygons are P, and the other unselected polygons are Q. For the convenience of explanation, the number of polygons in the model structure is determined to be 2 in this embodiment, that is, the first polygon P and the second polygon Q can be used for schematic explanation. Projection is performed on the two-dimensional reference plane S created by the top view and geometric parameter information to obtain the first projection area region S(P) and the second projection area region S(Q), and they are stored in the structure of the corresponding polygon, and the projection area region S of the overall model on the reference plane S is stored. total .

[0067] The projection process is explained using polygon P as an example. Figure 2 , Figure 2This is a diagram of the transformation process of the projection area of ​​polygons P, etc. on the reference plane S.

[0068] Perform the following two-dimensional transformation on each polygonal area:

[0069]

[0070] Among them, (x, y) is a point in A, B, C, D; (x', y') is a point in A', B', C', D'; c1, c2, c3, c4, c5, c6, c7, c8 are the parameter values ​​in the calculated projection matrix.

[0071] Step S40, determining the positional relationship between the first projection area region and the second projection area region, and outputting a determination result.

[0072] It should be noted that the positional relationship between the first projection area region and the second projection area region includes three states: inclusion, intersection, and separation, and the judgment result reflects the positional relationship between the first projection area region and the second projection area region.

[0073] In a specific implementation, it is possible to perform an overlap judgment on the positional relationship between the first projection area region and the second projection area region; when the positional relationship between the first projection area region and the second projection area region is an overlap relationship, a first judgment result is output; when the positional relationship between the first projection area region and the second projection area region is not an overlap relationship, a second judgment result is output. The first judgment result and the second judgment result are used to describe the overlap relationship between the first projection area region and the second projection area region.

[0074] In a feasible embodiment, when the positional relationship between the first projection area region and the second projection area region is an overlapping relationship, outputting the first judgment result includes:

[0075] When the positional relationship between the first projection area region and the second projection area region is an overlapping relationship, traverse the first edge set of the first polygon and the second edge set of the second polygon; perform an intersection test on the first edge in the first edge set and the second edge in the second edge set to obtain an intersection detection result; when the intersection detection result is an intersection, output a first judgment result that the first polygon and the second polygon intersect.

[0076] In a specific implementation, the overlapping relationship between the first projection area region and the second projection area region can be detected. When it is determined to be an overlap, all edges in the first edge set of the first polygon can be traversed to perform an intersection test with the edges in the second edge set of the second polygon. The traversal process is to perform intersection tests on the edges in the first edge set in sequence with the edges in the second edge set to obtain an intersection detection result. If two edges are in an intersection relationship during the traversal process, a first judgment result that the first polygon and the second polygon are intersecting can be output.

[0077] In a feasible embodiment, after the step of performing an intersection test on the first edge in the first edge set and the second edge in the second edge set to obtain an intersection detection result, the step further includes:

[0078] When the intersection detection result is non-intersection, return to the step of performing intersection test on the first edge in the first edge set and the second edge in the second edge set to obtain the intersection detection result until all the edges in the first edge set and the second edge set are traversed; after all the edges in the first edge set and the second edge set are traversed, the intersection detection result is judged; when the intersection detection result is non-intersection, output a first judgment result that the first polygon and the second polygon do not intersect.

[0079] In a specific implementation, when an intersection test is performed on the first edge in the first edge set and the second edge in the second edge set to obtain an intersection detection result, if after the first edge set and the second edge set are all traversed, if the intersection detection results obtained are all non-intersection, a first judgment result that the first polygon and the second polygon do not intersect is output.

[0080] In a feasible embodiment, after the step of outputting the first judgment result that the first polygon and the second polygon do not intersect, the method further includes:

[0081] Determine the area relationship between the first projection area region and the second projection area region, and determine a large-area polygon and a small-area polygon based on the area relationship, wherein the area of ​​the projection area region of the large-area polygon is greater than the area of ​​the projection area region of the small-area polygon; determine the vertices of the small-area polygon; determine the positional relationship between the vertices of the small-area polygon and the large-area polygon; when the positional relationship is that the vertices of the small-area polygon are all located inside the large-area polygon, determine that the small-area polygon and the large-area polygon are in a containment relationship, and output a first output result that the first polygon and the second polygon are completely contained.

[0082] In a specific implementation, when it is determined that two polygons are non-intersecting, the area relationship between the first projection area region and the second projection area region can be determined to determine the large-area polygon and the small-area polygon, wherein the area of ​​the projection area region of the large-area polygon is greater than the area of ​​the projection area region of the small-area polygon. At this time, the vertices of the small-area polygon can be determined, and the positional relationship between the first polygon and the second polygon can be determined based on the positional relationship between the vertices of the small-area polygon and the large-area polygon. When the positional relationship is that the vertices of the small-area polygon are all located inside the large-area polygon, it is determined that the small-area polygon and the large-area polygon are in a containment relationship, and a first output result that the first polygon and the second polygon are completely contained is output.

[0083] Correspondingly, when the positional relationship is that all vertices of the small-area polygon are located outside the large-area polygon, it is determined that the small-area polygon and the large-area polygon are in a separation relationship, and a first output result of separation of the first polygon and the second polygon is output.

[0084] The present embodiment provides a method for quickly identifying the geometric relationship judgment of polygon intersections, by reading and storing all geometric parameter information in a geometric model; determining an observation angle, and establishing a two-dimensional reference plane based on the observation angle and the geometric parameter information, wherein the two-dimensional reference plane is in a one-to-one matching relationship with the observation angle; determining a first polygon and a second polygon in a model structure, and generating a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation angle; judging the positional relationship between the first projection area region and the second projection area region, and outputting a judgment result, so as to solve the problem that the geometric model processing speed of a multi-layer complex structure PCB board-level system model is slow and the edge alignment cannot be judged.

[0085] For example, in order to help understand the implementation process of the method for quickly identifying the geometric relationship of polygon intersection obtained by combining the present embodiment with the above-mentioned embodiment 1, please refer to Figure 3 , Figure 3 A brief flowchart of a method for quickly identifying the geometric relationship of polygon intersection is provided, specifically:

[0086] Step S1: Read and store all geometric parameter information of the entire model, including the point, line, surface and other element structure information of each polygon;

[0087] Step S2: Establish a two-dimensional reference plane S that matches the model observation angle. Generally, the reference plane is constructed in the direction of the top view, and then used as the reference for the projection outer contour of the polygon;

[0088] Step S3: Place all polygons P, Q, etc. in the model structure on the reference plane S, respectively construct their projection area S(P) and S(Q) on the reference plane S from the top view, and store them in the structure of the corresponding polygons, and store the projection area S of the entire model on the reference plane S total ;

[0089] Step S4: Determine whether the projected area regions S(P) and S(Q) of polygons P and Q overlap. If not, return that the two polygons do not intersect. Otherwise, proceed to the following steps, traverse all polygons and repeat the above operation.

[0090] Step S5: For the polygons P and Q that overlap in the projected area, traverse the edges of the two polygons and test them. If an intersection is found, the intersection of the two polygons is returned. If all edge pairs are tested and no valid intersection is found, proceed to the next step;

[0091] Step S6: for polygons P and Q where no valid intersection is found after the test, determine whether P and Q are in a containment relationship. If not, the two polygons are separated. Otherwise, the two polygons are completely contained.

[0092] Step S7: Sorting out the intersection identification and edge alignment of all polygons. It should be noted that the above examples are only used to understand the present application and do not constitute a limitation on the geometric relationship judgment method for quickly identifying the intersection of polygons in the present application. More simple transformations based on this technical concept are all within the scope of protection of the present application.

[0093] This application is aimed at the multi-layer complex structure PCB board-level system model in identifying the geometric relationship judgment of polygon intersection, which greatly reduces the complexity of calculation, improves the overall solution efficiency, and makes up for the defect that traditional methods are difficult to identify edge alignment problems.

[0094] This application also provides a geometric relationship judgment device for quickly identifying polygon intersections, please refer to Figure 4 The geometric relationship judgment device for quickly identifying the intersection of polygons includes:

[0095] The information reading module 10 is used to read and store all geometric parameter information in the geometric model;

[0096] A reference plane generating module 20, for determining an observation angle, and establishing a two-dimensional reference plane based on the observation angle and the geometric parameter information, wherein the two-dimensional reference plane is in a one-to-one matching relationship with the observation angle;

[0097] A model projection module 30, configured to determine a first polygon and a second polygon in the model structure, and generate a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation viewing angle;

[0098] The position identification module 40 is used to determine the positional relationship between the first projection area region and the second projection area region, and output a determination result.

[0099] The device for quickly identifying the geometric relationship judgment of polygon intersections provided by the present application adopts the method for quickly identifying the geometric relationship judgment of polygon intersections in the above-mentioned embodiment, which can solve the technical problems in the prior art that the geometric model processing speed of multi-layer complex structure PCB board-level system model is slow and the edge alignment cannot be judged. Compared with the prior art, the beneficial effects of the device for quickly identifying the geometric relationship judgment of polygon intersections provided by the present application are the same as the beneficial effects of the method for quickly identifying the geometric relationship judgment of polygon intersections provided by the above-mentioned embodiment, and the other technical features of the device for quickly identifying the geometric relationship judgment of polygon intersections are the same as the features disclosed in the above-mentioned embodiment method, which will not be repeated here.

[0100] The present application provides a device for quickly identifying the geometric relationship judgment of polygon intersections, and the device for quickly identifying the geometric relationship judgment of polygon intersections includes: at least one processor; and a memory that is communicatively connected to the at least one processor; wherein the memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the method for quickly identifying the geometric relationship judgment of polygon intersections in the above-mentioned embodiment one.

[0101] Reference below Figure 5 , which shows a schematic diagram of the structure of a geometric relationship judgment device for quickly identifying polygon intersections suitable for implementing the embodiment of the present application. The geometric relationship judgment device for quickly identifying polygon intersections in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 5 The geometric relationship judgment device for quickly identifying polygon intersections is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0102] like Figure 5As shown, the geometric relationship judgment device for quickly identifying the intersection of polygons may include a processing device 1001 (such as a central processing unit, a graphics processor, etc.), which can perform various appropriate actions and processes according to the program stored in a read-only memory (ROM: Read Only Memory) 1002 or the program loaded from a storage device 1003 to a random access memory (RAM: Random Access Memory) 1004. Various programs and data required for the operation of the geometric relationship judgment device for quickly identifying the intersection of polygons are also stored in RAM1004. The processing device 1001, ROM1002 and RAM1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems can be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 1003 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 1009. The communication device 1009 can allow the geometric relationship judgment device for quickly identifying the intersection of polygons to communicate wirelessly or wired with other devices to exchange data. Although the figure shows a geometric relationship judgment device for quickly identifying the intersection of polygons with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems may be implemented or have instead.

[0103] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0104] The device for quickly identifying the geometric relationship judgment of polygon intersections provided by the present application adopts the method for quickly identifying the geometric relationship judgment of polygon intersections in the above-mentioned embodiment, which can solve the technical problems in the prior art that the geometric model processing speed of multi-layer complex structure PCB board-level system model is slow and the edge alignment cannot be judged. Compared with the prior art, the beneficial effects of the device for quickly identifying the geometric relationship judgment of polygon intersections provided by the present application are the same as the beneficial effects of the method for quickly identifying the geometric relationship judgment of polygon intersections provided by the above-mentioned embodiment, and the other technical features of the device for quickly identifying the geometric relationship judgment of polygon intersections are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.

[0105] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0106] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0107] The present application provides a computer-readable storage medium having computer-readable program instructions (ie, computer programs) stored thereon, and the computer-readable program instructions are used to execute the geometric relationship determination method for quickly identifying polygon intersections in the above-mentioned embodiment.

[0108] The computer-readable storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, 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 disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination of the above.

[0109] The computer-readable storage medium may be included in the geometric relationship judgment device for quickly identifying the intersection of polygons; or may exist independently without being assembled into the geometric relationship judgment device for quickly identifying the intersection of polygons.

[0110] The computer-readable storage medium carries one or more programs. When the one or more programs are executed by the geometric relationship judgment device for quickly identifying the intersection of polygons, the geometric relationship judgment device for quickly identifying the intersection of polygons:

[0111] Read and store all geometric parameter information in the geometric model;

[0112] Determine an observation angle, and establish a two-dimensional reference plane based on the observation angle and the geometric parameter information, wherein the two-dimensional reference plane is in a one-to-one matching relationship with the observation angle;

[0113] Determine a first polygon and a second polygon in the model structure, and generate a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation angle;

[0114] The positional relationship between the first projection area region and the second projection area region is judged, and a judgment result is output.

[0115] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0116] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0117] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0118] The readable storage medium provided by the present application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned method for quickly identifying the geometric relationship judgment of polygon intersections, and can solve the technical problems in the prior art that the geometric model processing speed of multi-layer complex structure PCB board-level system model is slow and the edge alignment cannot be judged. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided by the present application are the same as the beneficial effects of the method for quickly identifying the geometric relationship judgment of polygon intersections provided by the above-mentioned embodiment, and will not be repeated here.

[0119] The present application also provides a computer program product, including a computer program, which, when executed by a processor, implements the steps of the geometric relationship determination method for quickly identifying polygon intersections as described above.

[0120] The computer program product provided by the present application can solve the technical problems in the prior art that the geometric model processing speed of the multi-layer complex structure PCB board-level system model is slow and the edge alignment cannot be determined. Compared with the prior art, the beneficial effects of the computer program product provided by the present application are the same as the beneficial effects of the method for quickly identifying the geometric relationship judgment of polygon intersection provided by the above embodiment, which will not be repeated here.

[0121] The above descriptions are only some embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structural changes made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect applications in other related technical fields are included in the patent protection scope of the present application.

Claims

1. A method for quickly identifying the geometric relationship of polygon intersections, characterized in that: The geometric relationship determination method for quickly identifying polygon intersections includes: Read and store all geometric parameter information in the geometric model; Determine an observation angle, and establish a two-dimensional reference plane based on the observation angle and the geometric parameter information, wherein the two-dimensional reference plane is in a one-to-one matching relationship with the observation angle; Determine a first polygon and a second polygon in the model structure, and generate a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation angle; The positional relationship between the first projection area region and the second projection area region is judged, and a judgment result is output.

2. The method according to claim 1, characterized in that The step of judging the positional relationship between the first projection area region and the second projection area region and outputting the judgment result comprises: Performing an overlap judgment on the positional relationship between the first projection area region and the second projection area region; When the positional relationship between the first projection area region and the second projection area region is an overlapping relationship, outputting a first judgment result; When the positional relationship between the first projection area region and the second projection area region is not an overlapping relationship, a second determination result is outputted.

3. The method according to claim 2, characterized in that When the positional relationship between the first projection area region and the second projection area region is an overlapping relationship, outputting a first judgment result includes: When the positional relationship between the first projection area region and the second projection area region is an overlapping relationship, traversing a first edge set of the first polygon and a second edge set of the second polygon; Performing an intersection test on a first edge in the first edge set and a second edge in the second edge set to obtain an intersection test result; When the intersection detection result is an intersection, a first determination result that the first polygon and the second polygon intersect is output.

4. The method according to claim 3, characterized in that After the step of performing intersection test on the first edge in the first edge set and the second edge in the second edge set to obtain the intersection test result, the method further includes: When the intersection detection result is no intersection, returning to the step of performing an intersection test on the first edge in the first edge set and the second edge in the second edge set to obtain an intersection detection result, until all edges in the first edge set and the second edge set are traversed; After all edges in the first edge set and the second edge set are traversed, judging the intersection detection result; When the intersection detection result is non-intersection, a first judgment result that the first polygon and the second polygon do not intersect is output.

5. The method according to claim 4, characterized in that After the step of outputting the first judgment result that the first polygon and the second polygon do not intersect, the method further includes: Determine an area relationship between the first projection area region and the second projection area region, and determine a large-area polygon and a small-area polygon according to the area relationship, wherein the area of ​​the projection area region of the large-area polygon is greater than the area of ​​the projection area region of the small-area polygon; Determine the vertices of the small-area polygon; Determine the positional relationship between the vertices of the small-area polygon and the large-area polygon; When the positional relationship is that all vertices of the small-area polygon are located inside the large-area polygon, it is determined that the small-area polygon and the large-area polygon are in a containment relationship, and a first output result that the first polygon and the second polygon are completely contained is output.

6. The method according to claim 5, characterized in that After the step of determining the positional relationship between the vertices of the small-area polygon and the large-area polygon, the method further includes: When the positional relationship is that all vertices of the small-area polygon are located outside the large-area polygon, it is determined that the small-area polygon and the large-area polygon are in a separation relationship, and a first output result of separation of the first polygon and the second polygon is output.

7. The method according to claim 2, characterized in that All geometric parameter information in the geometric model includes element structure information of each polygon in the geometric model, including at least points, lines, and surfaces.

8. A geometric relationship judgment device for quickly identifying polygon intersections, characterized in that: The device comprises: An information reading module is used to read and store all geometric parameter information in the geometric model; A reference plane generation module, used to determine an observation angle, and to establish a two-dimensional reference plane based on the observation angle and the geometric parameter information, wherein the two-dimensional reference plane is in a one-to-one matching relationship with the observation angle; A model projection module, used to determine a first polygon and a second polygon in the model structure, and generate a first projection area region and a second projection area region on the two-dimensional reference plane based on the observation angle; The position identification module is used to determine the positional relationship between the first projection area region and the second projection area region, and output a determination result.

9. A geometric relationship judgment device for quickly identifying polygon intersections, characterized in that: The device comprises: a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the method for quickly identifying the geometric relationship of polygon intersection as described in any one of claims 1 to 7.

10. A storage medium, characterized in that: The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the method for quickly identifying the geometric relationship of polygon intersection as described in any one of claims 1 to 7 are implemented.