A geometric overlap identification method, device, equipment and storage medium

Abstract

The present invention relates to the technical field of computer graphics processing, and discloses a method, device, equipment and storage medium for geometric overlap recognition, the method comprising: obtaining free edges of a geometric model, identifying relative edges that meet the geometric overlap scenario from all free edges, obtaining the faces to which each relative edge belongs, and designating one face as a reference face and the other face as a target face, calculating the marking points of the reference face and the normal vector of the marking points on the reference face, and creating an extended line segment along the direction of the normal vector, judging whether there is an intersection between the extended line segment and the target face, and if the number of intersections is not zero and the number of intersections is less than the number of marking points, the reference face and the target face have a geometric overlap. The present invention can improve the efficiency and accuracy of geometric overlap recognition.

Description

Technical Field

[0001] The present invention relates to the field of computer graphics processing technology, and in particular to a geometric overlap recognition method, device, equipment and storage medium. Background Art

[0002] Geometric overlap in complex engineering structures refers to a scenario where surfaces partially overlap and have certain constraints. The overlap phenomenon usually occurs when the CAD model is imported into the CAE software. Due to the excessively large tolerance value, two surfaces partially overlap. This overlap may manifest as adjacent parts of the model not being accurately docked at the boundary, forming a tiny overlapping area, affecting the accuracy of subsequent meshing and simulation analysis. Therefore, geometric overlap identification is an indispensable part of CAE defect identification.

[0003] However, the inventors found that the traditional geometric overlap recognition method has the following main problems: limited recognition scenarios, usually using sampling to roughly determine whether the overlap definition is basically met, while ignoring the overlap in many special scenarios; difficult to identify: the geometric overlap structure is complex and diverse, and manual or semi-automatic recognition methods are prone to missed or misidentified situations; low efficiency: in large 3D models, face-by-face overlap recognition requires a lot of computing resources, and traditional methods are often inefficient and difficult to meet the rapid needs of engineering projects; insufficient accuracy:

[0004] Since simulation analysis requires high accuracy of geometric models, identification errors may lead to deviations in simulation results, which in turn affects engineering design and decision-making.

[0005] In order to improve the efficiency and accuracy of geometric overlap recognition, a method is urgently needed to quickly and accurately identify geometric overlap structures with partially overlapping surfaces. Summary of the invention

[0006] The existing technology has low geometric overlap recognition efficiency and insufficient recognition accuracy, which affects the accuracy and reliability of subsequent simulation analysis.

[0007] To solve this problem, the present invention provides a geometric overlap recognition method for identifying overlap situations in a geometric model. The steps of the recognition method include:

[0008] Step S1, obtaining all free edges of the geometric model, identifying a pair of relative edges that meet the geometric overlap scenario from the free edges, and marking the pair of relative edges as a to-be-processed group N; wherein a free edge is an edge that belongs to only one face in the geometric model; a relative edge is a free edge of the overlapping part of two overlapping faces in the geometric overlap scenario, and N is a positive integer;

[0009] Perform the following steps for the treatment group N:

[0010] Step S2, obtaining the faces to which a pair of opposite edges in the to-be-processed group N belong, and designating one of the faces as a reference face and the other face as a target face;

[0011] Step S3, calculating the marking point of the reference plane and the normal vector of the marking point on the reference plane, and creating an extended line segment along the direction of the normal vector;

[0012] Step S4, determining whether there are any intersections between the extended line segment and the target surface, if the number of intersections is not zero and is less than the number of marking points, then there is a geometric overlap between the reference surface and the target surface;

[0013] Step S5, execute steps S2 to S4 for the processing group N+1.

[0014] In other embodiments, the step of obtaining the free edge of the geometric model includes:

[0015] Traverse all the faces of the geometric model and identify the edges that belong to only one face in the geometric model, that is, the free edges.

[0016] In other embodiments, the step of identifying a pair of opposite edges from the free edges that meet the geometric overlap scenario includes:

[0017] Calculate the bounding boxes of all free edges;

[0018] Identify all bounding boxes that intersect each other, and determine whether the two free edges corresponding to the bounding boxes belong to the same face;

[0019] If the two free edges do not belong to the same face, then the two free edges are a pair of opposite edges that conform to the geometric overlap scenario.

[0020] In other embodiments, if the two free edges do not belong to the same surface, the step of forming the two free edges into a pair of opposite edges that conform to the geometric overlap scenario further includes:

[0021] Set two free edges that do not belong to the same face as the first free edge and the second free edge respectively;

[0022] Project the start point and end point of the first free edge onto the surface to which the second free edge belongs respectively;

[0023] Project the start point and end point of the second free edge onto the surface to which the first free edge belongs respectively;

[0024] Determine whether there are projection points of the start point and the end point of the second free edge on the surface to which the first free edge belongs, and whether there are projection points of the start point and the end point of the first free edge on the surface to which the second free edge belongs;

[0025] If there are two projection points on the surface to which the first free edge belongs or on the surface to which the second free edge belongs, the first free edge and the second free edge are a pair of opposite edges that meet the geometric overlap condition.

[0026] In other embodiments, the step of calculating the marking points of the reference surface includes:

[0027] Calculate the boundary limit coordinates of the reference surface, and determine the bounding box of the reference surface based on the boundary limit coordinates;

[0028] The nearest position on the reference plane to the boundary point of the bounding box of the reference plane is calculated, and the nearest position is calibrated by UV coordinates to form a parameterized domain, and a position is determined from the parameterized domain as a marking point.

[0029] In other embodiments, if the number of intersection points is not zero, the step includes:

[0030] The extended line segment intersects the target surface, and the normal vector of the intersection on the target surface is calculated;

[0031] Calculate the angle between the normal vector on the reference surface and the normal vector on the target surface;

[0032] Determine whether the angle is less than a preset angle value;

[0033] If so, the reference and target surfaces overlap.

[0034] The present invention also provides a geometric overlap recognition method for identifying overlap situations in a geometric model. The recognition method comprises the following steps:

[0035] Step S1, obtaining all free edges of the geometric model, identifying a pair of relative edges that meet the geometric overlap scenario from the free edges, and marking the pair of relative edges as a to-be-processed group N; wherein a free edge is an edge that belongs to only one face in the geometric model; a relative edge is a free edge of the overlapping part of two overlapping faces in the geometric overlap scenario, and N is a positive integer;

[0036] Perform the following steps for the treatment group N:

[0037] Step S2, respectively calculating the length between the starting points, the length between the midpoints and the length of the end point of a pair of opposite sides, and determining whether the length between the starting points, the length between the midpoints and the length of the end point are all within a first tolerance value range;

[0038] Step S3, execute step S2 for the processing group N+1.

[0039] The present invention also provides a geometric overlap recognition device, which includes:

[0040] The edge recognition module is used to obtain all free edges of the geometric model, identify a pair of relative edges that meet the geometric overlap scenario from the free edges, and mark the pair of relative edges as a to-be-processed group N; wherein the free edge is an edge that belongs to only one face in the geometric model; the relative edge is a free edge of the overlapping part of two overlapping faces in the geometric overlap scenario, and N is a positive integer;

[0041] A face acquisition module is used to acquire faces to which a pair of opposite edges in the group N to be processed belongs, and designate one face as a reference face and the other face as a target face;

[0042] A calculation module, used for calculating the marking point of the reference plane and the normal vector of the marking point on the reference plane, and creating an extended line segment along the direction of the normal vector;

[0043] The judgment module is used to judge whether there are intersections between the extended line segment and the target surface. If the number of intersections is not zero and is less than the number of marking points, the reference surface and the target surface are geometrically overlapped.

[0044] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the steps of the aforementioned geometric overlap identification method are implemented.

[0045] The present invention also provides a computer-readable storage medium storing a computer program, which can be executed by a processor to implement the aforementioned geometric overlap recognition method.

[0046] The beneficial effects of the present invention are as follows: the present solution first obtains the free edges of the geometric model, and identifies the free edges that meet the overlap scenario from all the free edges, and quickly excludes some edges based on lines, thereby improving the efficiency of calculating overlap. Then, the surface to which the identified free edges belong is finely identified to improve the accuracy of geometric overlap identification. Compared with the recognition method based on surface calculation and one-by-one traversal in the prior art, the present invention quickly excludes some free edges that do not meet the overlap based on lines, and then finely identifies them through surfaces, thereby improving recognition efficiency and recognition accuracy. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0048] Figure 1 is a schematic diagram of an embodiment of a geometric overlap scene of the present invention;

[0049] Figure 2 is a schematic diagram of another embodiment of a geometric overlap scene of the present invention;

[0050] Figure 3 It is a schematic diagram of a flow chart of an embodiment of a geometric overlap identification method of the present invention;

[0051] Figure 4is a schematic diagram of an embodiment of a geometric model of the present invention;

[0052] Figure 5 is a schematic diagram of a process for identifying relative edges in an embodiment of a geometric overlap identification method of the present invention;

[0053] Figure 6 It is a structural schematic diagram of an embodiment of a bounding box obtained by expanding the tolerance value of the free edge of the present invention;

[0054] Figure 7 It is a flow chart of an embodiment of the present invention for determining whether the faces to which two free edges of intersecting bounding boxes belong overlap;

[0055] Figure 8 It is a flow chart of an embodiment of the present invention for calculating the marking points of the reference surface for geometric overlap recognition;

[0056] Fig. 9 It is a schematic diagram of a process of determining the angle between two normal vectors in an embodiment of geometric overlap recognition of the present invention;

[0057] Fig.10 It is a structural schematic diagram of an embodiment of a geometric overlap identification device of the present invention;

[0058] Fig.11 is a schematic structural diagram of an electronic device according to an embodiment of the present invention;

[0059] Fig.12 It is a structural schematic diagram of an embodiment of a computer-readable storage medium of the present invention. DETAILED DESCRIPTION

[0060] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0061] The terms "first" and "second" in the present invention are only used for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Thus, the features defined as "first" and "second" can explicitly or implicitly include at least one of the features. In the description of the present invention, the meaning of "multiple" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions. For example, a process, method, system, product or terminal that includes a series of steps or units is not limited to the listed steps or units, but optionally also includes steps or units that are not listed, or optionally also includes other steps or units inherent to these processes, methods, products or terminals.

[0062] Reference to an "embodiment" herein means that a particular feature, structure, or characteristic described in conjunction with the embodiment may be included in at least one embodiment of the present invention. The appearance of the phrase in various places in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive of other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0063] The following are the relevant professional terms involved in the present invention:

[0064] Geometric overlap: When the CAD model is imported into CAE software, due to the stitching tolerance value being set too large, two surfaces partially overlap. This overlap is manifested as adjacent parts of the model not being accurately docked at the boundary, forming a small overlapping area, that is, two adjacent surfaces partially overlap and at least one edge partially overlaps. Geometric overlap usually occurs when the CAD model is imported into CAE software, especially in the pre-processing stage of simulation such as finite element analysis (FEA) or computational fluid dynamics (CFD).

[0065] Free edge: An edge in a geometric model that belongs to only one face and does not touch other faces.

[0066] Overlap edge: Appears in geometric overlap scenes, where two adjacent faces partially overlap in the overlapping area.

[0067] Opposite edge: Appears in the geometric overlap scene, and is the free edge of the overlapping parts of two overlapping faces.

[0068] Bounding box: A bounding box is a simple geometric shape that can completely contain a more complex geometric object, such as a line segment, a face, or an entire geometric body. It is used to quickly determine whether there is intersection or overlap between geometric objects.

[0069] Hierarchical bounding volume: BVH for short, Bounding Volume Hierarchy, is a tree-like data structure where each node represents a bounding box, which in turn contains other smaller bounding boxes or final geometric objects. BVH can significantly reduce the amount of computation required for intersection testing, allowing for quick exclusion of geometric objects that are unlikely to intersect, and quick location of possible intersection areas.

[0070] Geometric similarity: curves or surfaces have similarities in shape, structure or form.

[0071] See also Figure 1 , Figure 1 It is a schematic diagram of an embodiment of a geometric overlap scene of the present invention. Among them, the first surface 100 and the second surface 200 of the geometric model are adjacent surfaces. When the geometric model is imported into the CAE scene, under normal circumstances, the first surface 100 and the second surface 200 are adjacent, and the two will not overlap. However, during the import process of the geometric model, due to the tolerance value being set too large, the adjacent parts are not accurately docked at the boundary, forming a small overlapping area, that is, a geometric overlap situation occurs. In the overlap scene, the first surface 100 and the second surface 200 partially overlap, and the gray area in the figure is the overlapping area of ​​the two surfaces. Among them, the first relative edge 101 belongs to the first surface 100 and is not connected to other surfaces; the second relative edge 201 belongs to the second surface 200 and is not connected to other surfaces. The overlapping edge 103 is the overlapping edge of the edge 102 of the first surface 100 and the edge 202 of the second surface 200. The length of the overlapping edge 103 is smaller than the length of the edge 102 of the first surface 100 and the length of the edge 202 of the second surface 200, and the length of the overlapping edge 103 is greater than zero.

[0072] See also Figure 2 , Figure 2 It is a schematic diagram of another embodiment of the geometric overlap scene of the present invention, from Figure 2 From a-2d, we can see that there is overlap between the two surfaces, that is, there is a partial overlapping area between the two surfaces, and at least one edge of the two surfaces partially overlaps.

[0073] See also Figure 3 , Figure 3 FIG. 1 is a flow chart of an embodiment of a geometric overlap identification method of the present invention. It should be noted that if there are substantially the same results, this embodiment does not use Figure 3 The process sequence shown is limited. This embodiment includes the following contents:

[0074] The present invention provides a geometric overlap recognition method for identifying defects of geometric overlap generated by a geometric model, wherein the geometric model includes at least two surfaces, and the recognition method comprises the following steps:

[0075] Step S1, obtaining all free edges of the geometric model, identifying a pair of relative edges that meet the geometric overlap scenario from the free edges, and marking the pair of relative edges as a to-be-processed group N; wherein a free edge is an edge that belongs to only one face in the geometric model; a relative edge is a free edge of the overlapping part of two overlapping faces in the geometric overlap scenario, and N is a positive integer;

[0076] Perform the following steps for the treatment group N:

[0077] Step S2, obtaining the faces to which a pair of opposite edges in the to-be-processed group N belong, and designating one of the faces as a reference face and the other face as a target face;

[0078] Step S3, calculating the marking point of the reference plane and the normal vector of the marking point on the reference plane, and creating an extended line segment along the direction of the normal vector;

[0079] Step S4, determining whether there are any intersections between the extended line segment and the target surface, if the number of intersections is not zero and is less than the number of marking points, then there is a geometric overlap between the reference surface and the target surface;

[0080] Step S5, execute steps S2 to S4 for the processing group N+1.

[0081] For step S1, see Figure 4 , Figure 4 FIG. 1 is a schematic diagram of an embodiment of a geometric model of the present invention. In the geometric model, multiple faces are included. All faces of the geometric model are traversed, and an edge belonging to only one face is selected from the geometric model, that is, the edge is owned by only one face, such as Figure 4 As shown, each of the four faces contains free edges that are not shared with other faces, that is, edge L1, edge L2, edge L3, edge L4, edge L5, edge L6, edge L7, edge L8, edge L9 and edge L10 are all free edges. After all the free edges of the geometric model are identified, not all free edges meet the overlap situation. Therefore, it is necessary to identify the relative edges that meet the overlap scenario from all the free edges and construct bounding boxes for all free edges. If the bounding boxes have intersections, the free edges corresponding to the intersecting bounding boxes are regarded as a pair of relative edges, and this pair of relative edges is marked as the group to be processed N, where N is a positive integer. Figure 4 As shown, the bounding boxes of edge L4 and edge L8 intersect, and edge L4 and edge L8 belong to different faces, so edge L4 and edge L8 are a pair of relative edges.

[0082] In some embodiments, see Figure 5 , Figure 5 The figure is a flow chart of identifying relative edges in the embodiment of the geometric overlap identification method of the present invention. The step of identifying a pair of relative edges that meet the geometric overlap scenario from all free edges includes:

[0083] Step S11: Calculate the bounding boxes of all free edges.

[0084] Step S12: Identify all bounding boxes that intersect each other, and determine whether the two free edges corresponding to the bounding boxes belong to the same surface;

[0085] Step S13: If the two free edges do not belong to the same face, the two free edges are a pair of opposite edges that meet the geometric overlap scenario.

[0086] For step S11, all free edges are extracted from the geometric model, and the line segments corresponding to the free edges are expanded by a certain tolerance value and then their bounding boxes are calculated. Specifically, for each free edge, the coordinates of the two end points of the line segment are determined and the tolerance value is expanded, such as Figure 6 As shown, set the line segment P1P2 as a free edge line segment that is expanded by a certain tolerance value, and create a minimum rectangular bounding box with vectors P1 (x1, y1, z1) and P2 (x2, y2, z2) in 3D space, with vectors P1 and P2 as the vertical angles, where the minimum point (minX, minY, minZ) and the maximum point (maxX, maxY, maxZ) of the bounding box are assumed, and the size of the bounding box is determined by comparing the coordinate values ​​of these two points, that is:

[0087] Calculate the minimum point (minX, minY, minZ):

[0088] minX = min(x1,x2);

[0089] minY=min(y1,y2);

[0090] minZ = min(z1,z2);

[0091] Calculate the maximum point (maxX, maxY, maxZ):

[0092] maxX=max(x1,x2);

[0093] maxY=max(y1,y2);

[0094] maxZ = max(z1,z2);

[0095] Calculate the bounding box for all free edges and use the bounding box to quickly determine whether geometric objects intersect or overlap.

[0096] For step S12 and step S13, after constructing bounding boxes for all free edges, a hierarchical bounding volume is constructed using the bounding boxes, and the hierarchical bounding volume is traversed to identify intersecting bounding boxes. By determining whether the bounding boxes intersect with each other, it is determined whether the corresponding free edges are adjacent, and then it is determined whether the two corresponding free edges belong to the same face. If the two free edges whose bounding boxes intersect belong to the same face, the two free edges do not belong to opposite edges, and there is no need to process them subsequently, and the next group of free edges is processed.

[0097] A hierarchical bounding volume is a tree-like data structure in which each node represents a bounding box, which in turn contains other smaller bounding boxes or final geometric objects or line segments. The construction of a hierarchical bounding volume can be done in a bottom-up or top-down manner, wherein the bottom-up approach starts with the bounding box of a single geometric object and gradually merges adjacent bounding boxes into larger bounding boxes until a single bounding box containing all objects is formed. The top-down approach starts with the bounding box of the entire model and recursively divides it into smaller bounding boxes until each leaf node contains one or more geometric objects. In the present embodiment, a top-down approach is selected to construct a hierarchical bounding volume, starting from the root node of the hierarchical bounding volume, recursively traversing the tree structure, and performing an intersection judgment at each node to determine whether the bounding box of the current node intersects with other bounding boxes.

[0098] For two bounding boxes, if their projections do not overlap on one or more coordinate axes, then the two bounding boxes do not intersect. If their projections overlap on all coordinate axes, then the two bounding boxes are considered to intersect. The specific judgment method is as follows:

[0099] Calculate the minimum and maximum values ​​of the two bounding boxes on each coordinate axis (X, Y, Z) respectively. On each coordinate axis, if the minimum value of one bounding box is greater than the maximum value of the other bounding box, or the maximum value of one bounding box is less than the minimum value of the other bounding box, they do not intersect. Once the bounding box is processed, mark it as processed to ensure that each bounding box is processed only once. The hierarchical bounding volume can significantly reduce the amount of calculation of the bounding box intersection test and quickly exclude bounding boxes that are unlikely to intersect.

[0100] In this embodiment, a bounding box is constructed for the free edges, a group of free edges corresponding to the intersecting bounding box is screened out, and each group of screened free edges is identified to determine whether the group of free edges belongs to the same face. If the group of free edges belongs to the same face, it indicates that there is no overlap scenario for the group of free edges, and no subsequent processing is required. If the group of free edges does not belong to the same face, subsequent processing is performed. Through this step, the processing of edges can be reduced, edges that do not meet the overlap situation can be quickly excluded, and the efficiency of geometric overlap recognition can be improved.

[0101] After determining that the two intersecting free edges of the bounding box do not belong to the same face, it is further determined whether the faces to which the two free edges belong overlap.

[0102] In some embodiments, see Figure 7 , Figure 7 This is a flow chart of an embodiment of the present invention for determining whether the faces to which two free edges of intersecting bounding boxes belong overlap, the step comprising:

[0103] Step S131: setting two free edges that do not belong to the same surface as a first free edge and a second free edge respectively.

[0104] Step S132: Project the start point and the end point of the first free edge onto the surface to which the second free edge belongs respectively.

[0105] Step S133: project the start point and the end point of the second free edge onto the surface to which the first free edge belongs respectively.

[0106] Step S134, determining whether there are projection points of the start point and the end point of the second free edge on the surface to which the first free edge belongs, and determining whether there are projection points of the start point and the end point of the first free edge on the surface to which the second free edge belongs.

[0107] Step S135: if the surface to which the first free edge belongs or the surface to which the second free edge belongs has two projection points, then the first free edge and the second free edge are a pair of opposite edges that meet the geometric overlap condition.

[0108] After determining that a group of free edges are on different faces, it is still necessary to determine whether the faces to which this group of free edges belongs overlap. Project the starting point and end point of the two free edges onto each other's faces respectively, and determine whether there are corresponding projection points from the starting point and end point of one free edge to the face to which the other free edge belongs. If both the projection points of the starting point and the end point exist, then the faces to which the two free edges belong overlap. If after the projection of one free edge, only the projection point of the starting point or the projection point of the end point exists, and after the projection of the starting point and the end point of the other free edge, only the projection point of the starting point or the projection point of the end point exists, then the faces to which the two free edges belong do not overlap. In this case, the two free edges whose bounding boxes intersect do not belong to the same face, but the faces to which the two free edges belong are in different three-dimensional spaces, and the two faces cannot overlap, that is, there are no overlapping situations.

[0109] In this embodiment, by further judging whether there is a geometric overlap between two free edges that are not on the same face, free edges that do not have a geometric overlap are removed, thereby reducing the amount of subsequent calculations and improving the accuracy of geometric overlap recognition.

[0110] After rough identification in step S1, a pair of relative edges that meet the geometric overlap scenario is identified by the intersection of the bounding boxes of the two free edges, and the group of relative edges is marked as a processing group N. Steps 2 to S5 are performed on the processing group N for fine screening.

[0111] For step S2, the faces to which a pair of opposite edges in the to-be-processed group N belong are obtained, and the face with the smaller area of ​​the two faces is designated as the reference face, and the other face is designated as the target face.

[0112] After the above step 2, a reference plane is determined, and it is determined whether the reference plane and the target plane have intersections. A point is randomly selected from the reference plane as a marking point of the reference plane, and a normal vector of the marking point is made on the reference plane to determine whether the normal vector of the marking point on the reference plane intersects with the target plane.

[0113] In some embodiments, see Figure 8 , Figure 8 This is a flow chart of an embodiment of calculating the marking points of the reference surface for geometric overlap recognition of the present invention. The step of calculating the marking points of the reference surface includes:

[0114] Step S31: Calculate the boundary limit coordinates of the reference surface, and determine the bounding box of the reference surface based on the boundary limit coordinates.

[0115] First, determine all the vertices of the reference surface. These vertices are the basis of the reference surface. For each vertex, extract its coordinates (x, y, z) in three-dimensional space, then traverse all vertices and find the minimum value min_pt (min_x, min_y, min_z) of the X, Y, and Z coordinate values ​​by comparing the coordinates of all vertices. Find the maximum value max_pt (max_x, max_y, max_z) of the X, Y, and Z coordinate values ​​by comparing the coordinates of all vertices. The boundary limits of the reference surface are the minimum point min_pt (min_x, min_y, min_z) and the maximum point

[0116] max_pt(max_x,max_y,max_z); Specifically, the boundary limit coordinates of the reference surface are determined in the following way:

[0117] min_pt=(min(x1,x2,...,xn),min(y1,y2,...,yn),min(z1,z2,...,zn));

[0118] max_pt=(max(x1,x2,...,xn),max(y1,y2,...,yn),max(z1,z2

[0119] ,...,zn)).

[0120] After determining the bounding limit coordinates of the reference surface, construct a bounding box based on the bounding limit coordinates of the reference surface. Adjust the size of the bounding box based on the bounding limit coordinates to ensure that it completely contains the reference surface, and verify that the bounding box correctly encloses all points of the reference surface by checking whether all vertices of the reference surface are inside the bounding box.

[0121] Step S32: Calculate the position on the reference plane that is closest to the boundary point of the bounding box of the reference plane, and calibrate the position through UV coordinates to form a parameterized domain, and determine a position from the parameterized domain as a marking point.

[0122] Calculate the position on the reference plane closest to the boundary point of the bounding box, that is, obtain the boundary point of the reference plane. After determining the position of the boundary point, the UV coordinate (u closest ,v closast ) to accurately calibrate these positions to form the parameterized domain of the reference surface. The sampled parameterized domain is undersampled, that is, P sub ={p i ∈P|preservation condition}; where P is the set of original data points on the reference surface, i.e., the majority class samples, P sub is the subset after undersampling, that is, the minority class sample, p i is a data point, and the retention condition is usually based on the calculation of distance or feature value. Distance metrics are usually used to determine which data points need to be retained. Common distance metrics include Euclidean distance, Manhattan distance, etc. Assume that the data point p1 = (x 11 ,x 12 ,x 13 ,....x 1n ) and p2=(x 21 ,x 22 ,x 23 ,....x 2n ), then the calculation formula of Euclidean distance d is:

[0123]

[0124] In distance-based undersampling, the nearest neighbor method can be used to select data points in the majority class samples. First, the distance between the majority class samples and the minority class samples is calculated, and the majority class samples with the closest distance are retained according to the distance; then, let the majority class sample set be X M , the minority class sample set is X m The goal is to M Select n samples from X so that these samples are consistent with X m The distance is the closest.

[0125] The undersampling algorithm can reduce the sampling time complexity and improve the computational efficiency. Assuming that the range of the coordinate axis UV is [0,1]×[0,1] and the sampling step is K, the time complexity of the sampling process is:

[0126]

[0127] Assume that the number of sampling points is reduced to the original The new time complexity is:

[0128]

[0129] Then, the parameterized domain of the undersampled reference surface is analyzed in detail to calculate the range of the U axis (u_min,u_max) and the range of the V axis (v_min,v_max), as well as the length u of the U axis. length and the length v of the V axis length The specific calculation formula is:

[0130] U axis range: u min =min(u closest ),u max =max(u closest );

[0131] V axis range: v min =min(v closest ), v max =max(u closest );

[0132] The length of the U axis: u length =u max -u min ;

[0133] The length of the V axis: v length =v max -v min .

[0134] When the lengths of the U axis and the V axis meet the expected conditions, the algorithm divides the U axis into i parts evenly and divides the V axis into i parts at each U axis point, where the sampling steps of the U axis and the V axis can be equal or unequal. For each (u,v) point, calculate the position Pnt(u,v) of the point on the reference plane and the corresponding normal vector aNorm(u,v), and verify whether it is inside the reference plane. The calculation formula of the position Pnt(u,v) is as follows:

[0135] P(u,v)=P0+uP u +vP v ;

[0136] Among them, P0 is a reference point of the datum plane, usually the origin; P u and P v are the tangent vectors along the U and V axes respectively; u and v are parameterized coordinates.

[0137] Suppose two points P1 and P2 in the UV coordinate system have coordinates (u1, v1) and (u2, v2) in the coordinate system, and their coordinates in three-dimensional space are p1 and p2 respectively. The UV coordinate difference is and The position difference is The calculation formula of the tangent vector of the U axis and the V axis is:

[0138]

[0139]

[0140] The calculation formula of the normal vector aNorm(u,v) corresponding to the position Pnt(u,v) is:

[0141] aNorm(u,v)=P u ×P v .

[0142] If the length of the U axis or V axis is less than the preset threshold, the algorithm automatically adjusts, re-acquires the bounding box of the reference plane, updates the range and length of the U axis and V axis, and re-divides the U axis and V axis to ensure the accuracy and stability of subsequent calculations. For points located inside the reference plane, a marker point is determined, and a line segment aLine is created along the normal vector direction of the marker point.

[0143] The above parameters are the basis for subsequent calculations and analysis, and are crucial to the accuracy and efficiency of geometric calculations, especially in intersection detection.

[0144] For step S4, it is determined whether there are intersections between the extended line segment and the target surface. If the number of intersections is not zero and is less than the number of marked points, the reference surface and the target surface are geometrically overlapped. If the extended line segments made by the marked points on the reference surface all have intersections on the target surface, that is, the number of marked points is equal to the number of intersections, the reference surface and the target surface completely overlap, and at this time, the reference surface and the target surface do not overlap.

[0145] Find the reference plane's landmark point and the landmark point's normal vector, determine if the extended line segment of the landmark point's normal vector intersects the target plane, further calculate the normal vector bNormal at the intersection, and evaluate the angle Angle between the two normal vectors. In some embodiments, refer to Fig. 9 , Fig. 9This is a schematic diagram of a flow chart of determining the angle between two normal vectors in an embodiment of geometric overlap recognition according to the present invention. The steps include:

[0146] Step S41: There is an intersection point between the extended line segment and the target surface, and the normal vector of the intersection point on the target surface is calculated.

[0147] Step S42: Calculate the angle between the normal vector on the reference surface and the normal vector on the target surface.

[0148] Step S43: Determine whether the angle is less than a preset angle value.

[0149] Step S44: If yes, the reference plane and the target plane overlap.

[0150] The normal vector of the reference plane and the target plane have an intersection point. Calculate the normal vector aNorm(u,v) of the intersection point on the target plane, and use the dot product formula to calculate the angle θ between the normal vector on the reference plane and the normal vector on the target plane. The angle calculation formula is as follows:

[0151]

[0152] Among them, aNorm·bNorm represents the dot product of two vectors, and ||aNorm||||bNorm|| represents the norm of two vectors. The specific calculation formula is as follows:

[0153] aNorm·bNorm=

[0154] aNorm x bNorm x +aNorm y bNorm y +aNorm z bNorm z ;

[0155]

[0156] It is determined whether the angle θ is smaller than a preset angle value. If the angle θ is smaller than the preset angle value, such as the preset angle value is set to 15 degrees in this embodiment, it is determined that there is geometric overlap between the reference plane and the target plane.

[0157] Finally, according to the calculated intersection number curNum, it is determined whether there is geometric overlap. If the intersection number curNum = 0, it means that no overlapping area is found; otherwise, the reference surface and the target surface overlap and there is a geometric overlap.

[0158] After executing steps S2 to S4, the next group to be processed, group N+1, is executed until the calculation of all relative edges of the group to be processed is completed, thereby completing the geometric overlap identification of the entire geometric model.

[0159] In other embodiments, the accuracy check is performed after the geometric overlap situation is identified. The accuracy check mechanism is introduced to ensure the accuracy and reliability of the identification results and meet the high-precision requirements of CAE simulation analysis.

[0160] In summary, the present invention has the following beneficial effects: through the method of the present invention, all free edges of the geometric model are first obtained, and free edges that meet the overlap scenario are identified from all free edges, and a part of the edges are quickly excluded based on lines, thereby improving the efficiency of calculating overlap. Then, the surface to which the identified free edges belong is finely identified to improve the accuracy of geometric overlap identification. Compared with the recognition method based on surface calculation and one-by-one traversal in the prior art, the present invention quickly excludes some free edges that do not meet the overlap based on lines, and then finely identifies them through surfaces, thereby improving recognition efficiency and recognition accuracy.

[0161] In other embodiments, after the rough identification in step S1, the geometric similarity of a pair of relative edges can also be used to identify scenes that meet the overlap definition. The geometric similarity includes that the length between the starting points, the length between the midpoints, and the length of the end points of a pair of relative edges are all within the first tolerance value δ1; or in the area where the faces to which a pair of relative edges belong overlap, the ratio of the long side to the short side of the adjacent edges is less than the second tolerance value δ2.

[0162] Specifically, when a pair of relative edges of the to-be-processed group N belong to different faces, the relative edges are respectively set as the first relative edge and the second relative edge. The starting point, the midpoint, and the end point of the first relative edge are respectively marked in the coordinate system as (x 11 ,y 11 )、(x 12 ,y 12 ) and (x 13 ,y 13 ), the starting point, midpoint, and end point of the second opposite side are (x 21 ,y 21 )、(x 22 ,y 22 ) and (x 23 ,y 23 ), calculate the distances between the starting point, midpoint, and end point of the first relative side and the second relative side respectively:

[0163] d1=(x 21 -x 11 ,y 21 -y 11 );

[0164] d2=(x 22 -x 12 ,y 22 -y 12 );

[0165] d3=(x23 -x 13 ,y 23 -y 13 ).

[0166] If the starting point distance d1, the midpoint distance d2, and the end point distance d3 are within the first tolerance value δ1

[0167] If the first relative edge and the second relative edge are within the range, the first relative edge and the second relative edge have geometric similarity, and the pair of relative edges are geometrically overlapped. The first tolerance value δ1 is set according to actual needs and is not numerically limited here.

[0168] Or see Figure 4 , according to the ratio of the long side A to the short side B in the overlapping area between the surface to which the opposite side L4 belongs and the surface to which the second opposite side L8 belongs If the value is less than the second tolerance value δ2, the set of relative edges has geometric similarity and there is geometric overlap. The value of the second tolerance value δ2 is set according to actual needs and is not numerically limited here.

[0169] This embodiment uses the geometric similarity of relative edges to quickly identify situations that meet several overlap scenarios, thereby reducing the amount of calculation for overlap recognition and improving overlap recognition efficiency.

[0170] Based on the same inventive concept, Fig.10 As shown, the present invention also provides a geometric overlap identification device, comprising:

[0171] The edge identification module 1001 is used to obtain all free edges of the geometric model, identify a pair of relative edges that meet the geometric overlap scenario from the free edges, and mark the pair of relative edges as a to-be-processed group N; wherein the free edge is an edge that belongs to only one face in the geometric model; the relative edge is a free edge of the overlapping part of two overlapping faces in the geometric overlap scenario, and N is a positive integer;

[0172] The surface acquisition module 1002 is used to acquire the surfaces to which a pair of opposite edges in the to-be-processed group N belong, and designate one of the surfaces as a reference surface and the other surface as a target surface;

[0173] The calculation module 1003 is used to calculate the marking point of the reference plane and the normal vector of the marking point on the reference plane, and to create an extended line segment along the direction of the normal vector;

[0174] The judgment module 1004 is used to judge whether there are intersections between the extended line segment and the target surface. If the number of intersections is not zero and is less than the number of marking points, the reference surface and the target surface are geometrically overlapped.

[0175] Other technical features applicable to the geometric overlap identification device are the same as those disclosed in the above-mentioned embodiment method and will not be described in detail here.

[0176] Based on the same inventive concept, Fig.11 As shown, the present invention also provides an electronic device corresponding to the above-mentioned geometric overlap recognition device, including:

[0177] A processor, a memory and a communication circuit, wherein the processor is connected to the memory and the communication circuit respectively;

[0178] The communication circuit is used for communication connection, the memory is used for storing a computer program, and the processor is used for executing the computer program to implement the above method.

[0179] See also Fig.11 The electronic device described in the embodiment of the present invention may specifically include a processor 210 and a memory 220 . The memory 220 is coupled to the processor 210 .

[0180] The processor 210 is used to control the operation of the electronic device. The processor 210 may also be referred to as a CPU (Central Processing Unit). The processor 210 may be an integrated circuit chip having signal processing capabilities. The processor 210 may also be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. A general-purpose processor may be a microprocessor or the processor 210 may also be any conventional processor, etc.

[0181] The memory 220 is used to store computer programs, and may be a RAM, a ROM, or other types of storage terminals. Specifically, the memory 220 may include one or more computer-readable storage media, which may be non-transitory or transient. The memory 220 may also include a high-speed random access memory, and a non-volatile memory, such as one or more disk storage terminals, flash memory storage terminals. In some embodiments, the non-transitory computer-readable storage medium in the memory 220 is used to store at least one program code.

[0182] The processor 210 is used to execute the computer program stored in the memory 220 to implement the methods described in the various method embodiments of the present invention.

[0183] In some embodiments, the electronic device may further include: a peripheral terminal interface 230 and at least one peripheral terminal. The processor 210, the memory 220 and the peripheral terminal interface 230 may be connected via a bus or a signal line. Each peripheral terminal may be connected to the peripheral terminal interface 230 via a bus, a signal line or a circuit board. Specifically, the peripheral terminal includes: at least one of a radio frequency circuit 240, a display screen 250, an audio circuit 260 and a power supply 270.

[0184] The peripheral terminal interface 230 may be used to connect at least one peripheral terminal related to I / O (Input / output) to the processor 210 and the memory 220. In some embodiments, the processor 210, the memory 220, and the peripheral terminal interface 230 are integrated on the same chip or circuit board; in some other implementations, any one or two of the processor 210, the memory 220, and the peripheral terminal interface 230 may be implemented on a separate chip or circuit board, which is not limited in this embodiment.

[0185] The radio frequency circuit 240 is used to receive and transmit RF (Radio Frequency) signals, also known as electromagnetic signals. The radio frequency circuit 240 communicates with the communication network and other IoT devices through electromagnetic signals, and the radio frequency circuit 240 is the communication circuit of the electronic device. The radio frequency circuit 240 converts the electrical signal into an electromagnetic signal for transmission, or converts the received electromagnetic signal into an electrical signal. Optionally, the radio frequency circuit 240 includes: an antenna system, an RF transceiver, one or more amplifiers, a tuner, an oscillator, a digital signal processor, a codec chipset, an operator identity module card, and the like. The radio frequency circuit 240 can communicate with other terminals through at least one wireless communication protocol. The wireless communication protocol includes but is not limited to: the World Wide Web, a metropolitan area network, an intranet, various generations of mobile communication networks (2G, 3G, 4G and 5G), a wireless local area network and / or a WiFi (Wireless Fidelity) network. In some embodiments, the radio frequency circuit 240 may also include circuits related to NFC (Near Field Communication), which is not limited in the present invention.

[0186] The display screen 250 is used to display the UI (User Interface). The UI may include graphics, text, icons, videos, and any combination thereof. When the display screen 250 is a touch display screen, the display screen 250 also has the ability to collect touch signals on the surface or above the surface of the display screen 250. The touch signal can be input to the processor 210 as a control signal for processing. At this time, the display screen 250 can also be used to provide virtual buttons and / or virtual keyboards, also known as soft buttons and / or soft keyboards. In some embodiments, the display screen 250 can be one, set on the front panel of the electronic device; in other embodiments, the display screen 250 can be at least two, respectively set on different surfaces of the electronic device or in a folding design; in other embodiments, the display screen 250 can be a flexible display screen, set on a curved surface or a folding surface of the electronic device. Even, the display screen 250 can also be set to a non-rectangular irregular shape, that is, a special-shaped screen. The display screen 250 can be made of materials such as LCD (Liquid Crystal Display), OLED (Organic Light Emitting Diode, organic light-emitting diode).

[0187] The audio circuit 260 may include a microphone and a speaker. The microphone is used to collect sound waves from the operator and the environment, and convert the sound waves into electrical signals and input them into the processor 210 for processing, or input them into the radio frequency circuit 240 to achieve voice communication. For the purpose of stereo acquisition or noise reduction, there may be multiple microphones, which are respectively arranged in different parts of the electronic device. The microphone may also be an array microphone or an omnidirectional acquisition microphone. The speaker is used to convert the electrical signal from the processor 210 or the radio frequency circuit 240 into sound waves. The speaker may be a traditional film speaker or a piezoelectric ceramic speaker. When the speaker is a piezoelectric ceramic speaker, it can not only convert the electrical signal into sound waves audible to humans, but also convert the electrical signal into sound waves inaudible to humans for purposes such as ranging. In some embodiments, the audio circuit 260 may also include a headphone jack.

[0188] The power supply 270 is used to power various components in the electronic device. The power supply 270 can be an alternating current, a direct current, a disposable battery, or a rechargeable battery. When the power supply 270 includes a rechargeable battery, the rechargeable battery can be a wired rechargeable battery or a wireless rechargeable battery. A wired rechargeable battery is a battery that is charged through a wired line, and a wireless rechargeable battery is a battery that is charged through a wireless coil. The rechargeable battery can also be used to support fast charging technology.

[0189] For detailed description of the functions and execution processes of each functional module or component in the embodiment of the Internet of Things device of the present invention, reference can be made to the description in the above-mentioned embodiment of each method of the present invention, which will not be repeated here.

[0190] In the several embodiments provided by the present invention, it should be understood that the disclosed IoT devices and methods can be implemented in other ways. For example, the various embodiments of the IoT devices described above are only schematic. For example, the division of modules or units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0191] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0192] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0193] On the other hand, the present invention provides a computer-readable storage medium storing a computer program, wherein the computer program can be executed by a processor to implement any of the above geometric overlap identification methods.

[0194] See also Fig.12 , if the above-mentioned integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium 300. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including several instructions / computer programs to enable an IoT device (which can be a personal computer, server, or network terminal, etc.) or a processor (processor) to perform all or part of the steps of each embodiment of the present invention. The aforementioned storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks or optical disks, and electronic terminals such as computers, mobile phones, laptops, tablet computers, cameras, etc. having the above-mentioned storage media.

[0195] The description of the execution process of the program data in the computer-readable storage medium can refer to the description in the above-mentioned various method embodiments of the present invention, which will not be repeated here.

[0196] The above descriptions are merely embodiments of the present invention and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. A method for identifying geometric overlap, used in the process of importing CAD models into CAE software, to identify overlaps in geometric models caused by setting stitching tolerance values ​​too large, characterized in that: The steps of the identification method include: Step S1, obtaining all free edges of the geometric model, identifying a pair of relative edges that meet the geometric overlap scenario from the free edges, and marking the pair of relative edges as a to-be-processed group N; wherein the free edge is an edge that belongs to only one face in the geometric model; the relative edge is a free edge of the overlapping part of two overlapping faces in the geometric overlap scenario, and N is a positive integer; The following steps are performed on the group N to be processed: Step S2, obtaining the faces to which a pair of opposite edges in the to-be-processed group N belong, and designating one of the faces as a reference face and the other face as a target face; Step S3, calculating the marking point of the reference plane and the normal vector of the marking point on the reference plane, and creating an extended line segment along the direction of the normal vector; Step S4, determining whether there are any intersections between the extended line segment and the target surface, if the number of the intersections is not zero and is less than the number of the marking points, then there is a geometric overlap between the reference surface and the target surface; Step S5, execute steps S2 to S4 for the processing group N+1.

2. The geometric overlap identification method according to claim 1, characterized in that: The step of obtaining the free edges of the geometric model comprises: All faces of the geometric model are traversed to identify the edges in the geometric model that belong to only one face, namely the free edges.

3. The geometric overlap identification method according to claim 1, characterized in that: The step of identifying a pair of opposite edges that meet the geometric overlap scenario from the free edges comprises: Calculate the bounding boxes of all the free edges; Identify all bounding boxes that intersect each other, and determine whether two free edges corresponding to the bounding boxes belong to the same surface; If the two free edges do not belong to the same face, the two free edges are a pair of opposite edges that conform to a geometric overlap scenario.

4. The geometric overlap identification method according to claim 3, characterized in that: If the two free edges do not belong to the same surface, the step of making the two free edges a pair of opposite edges that conform to the geometric overlap scenario also includes: The two free edges that do not belong to the same surface are respectively set as a first free edge and a second free edge; Projecting the start point and the end point of the first free edge onto the surface to which the second free edge belongs respectively; Projecting the start point and the end point of the second free edge onto the surface to which the first free edge belongs respectively; Determine whether there are projection points of the start point and the end point of the second free edge on the surface to which the first free edge belongs, and whether there are projection points of the start point and the end point of the first free edge on the surface to which the second free edge belongs; If there are two projection points on the surface to which the first free edge belongs or on the surface to which the second free edge belongs, then the first free edge and the second free edge are a pair of opposite edges that meet the geometric overlap condition.

5. The geometric overlap identification method according to claim 1, characterized in that: The step of calculating the marking points of the reference surface comprises: Calculating the boundary limit coordinates of the reference plane, and determining the bounding box of the reference plane based on the boundary limit coordinates; The position on the reference plane closest to the boundary point of the bounding box of the reference plane is calculated, and the nearest position is calibrated by UV coordinates to form a parameterized domain, and a position is determined from the parameterized domain as the marking point.

6. The geometric overlap identification method according to claim 1, characterized in that: The step of if the number of intersection points is not zero comprises: The extended line segment and the target surface have an intersection point, and a normal vector of the intersection point on the target surface is calculated; Calculating the angle between the normal vector on the reference surface and the normal vector on the target surface; Determining whether the angle is less than a preset angle value; If so, the reference surface and the target surface overlap.

7. A method for identifying geometric overlap, used in the process of importing CAD models into CAE software, to identify overlaps in geometric models caused by setting stitching tolerance values ​​too large, characterized in that: The steps of the identification method include: Step S1, obtaining all free edges of the geometric model, identifying a pair of relative edges that meet the geometric overlap scenario from the free edges, and marking the pair of relative edges as a to-be-processed group N; wherein the free edge is an edge that belongs to only one face in the geometric model; the relative edge is a free edge of the overlapping part of two overlapping faces in the geometric overlap scenario, and N is a positive integer; The following steps are performed on the group N to be processed: Step S2, respectively calculating the length between the starting points, the length between the midpoints and the length of the end point of the pair of opposite sides, and determining whether the length between the starting points, the length between the midpoints and the length of the end point are all within a first tolerance value range; If the length between the starting points, the length between the midpoints and the length of the end points are all within the first tolerance value range, the pair of opposite sides have geometric similarity and there is geometric overlap between the pair of opposite sides; Step S3, execute step S2 for the processing group N+1.

8. A geometric overlap recognition device, used in the process of importing CAD models into CAE software, to identify overlaps in geometric models caused by setting stitching tolerance values ​​too large, characterized in that: The geometric overlap recognition device comprises: an edge identification module, used to obtain all free edges of the geometric model, identify a pair of relative edges that meet the geometric overlap scenario from the free edges, and mark the pair of relative edges as a to-be-processed group N; wherein the free edge is an edge that belongs to only one face in the geometric model; the relative edge is a free edge of an overlapping portion of two overlapping faces in the geometric overlap scenario, and N is a positive integer; A surface acquisition module, used for acquiring the surfaces to which a pair of opposite edges in the to-be-processed group N belong, and designating one of the surfaces as a reference surface and the other surface as a target surface; A calculation module, used for calculating the marking point of the reference plane and the normal vector of the marking point on the reference plane, and creating an extended line segment along the direction of the normal vector; The judgment module is used to judge whether there are intersections between the extended line segment and the target surface. If the number of the intersections is not zero and is less than the number of the marking points, then there is a geometric overlap between the reference surface and the target surface.

9. An electronic device, characterized in that: The method comprises a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the geometric overlap recognition method as claimed in any one of claims 1 to 6 when executing the computer program, or implements the steps of the geometric overlap recognition method as claimed in claim 7 when executing the computer program.

10. A computer-readable storage medium, characterized in that: A computer program is stored, and the computer program can be executed by a processor to implement the geometric overlap recognition method according to any one of claims 1 to 6, or to implement the geometric overlap recognition method according to claim 7.

Images