Information extraction method for viscose modeling, viscose modeling method and related device

Abstract

The present invention provides an information extraction method for modeling viscose, a modeling method for viscose, a computer-readable storage medium and a computer device, wherein the information extraction method comprises the following steps: S1: according to the geometric topology of the viscose, all edges of the viscose are traversed to obtain the following geometric edges, the geometric edges belong to the boundary edges of the viscose, and the geometric edges are correspondingly stored in the following edge groups, the edge groups are assigned to the boundary edges to which the geometric edges belong; S2: the geometric center line of the viscose is obtained according to the edge group. By automatically extracting the geometric topology of the viscose through an algorithm, batch information extraction and modeling of the viscose can be realized; all geometric edges of the viscose are traversed and the geometric center line is obtained, and the obtained geometric center line data is more accurate, reducing errors and omissions in manual operations; by obtaining the boundary edges through a continuous boundary algorithm, the two longest boundary edges can be obtained more accurately, thereby improving the accuracy of the geometric center line finally obtained.

Description

Technical Field

[0001] The invention relates to the field of automobile adhesive modeling, and in particular to an information extraction method for adhesive modeling, an adhesive modeling method, a computer-readable storage medium and a computer device. Background Art

[0002] Automobile sheet metal parts are usually connected by sealing adhesives, such as structural adhesives, expansion adhesives, etc. This kind of sealing adhesive has high strength, simple construction, corrosion resistance and fatigue resistance, and is widely used in the connection of automobile sheet metal parts.

[0003] The traditional adhesive CAE (Computer Aided Engineering) modeling method is for engineers to manually select a single adhesive geometry, then visually observe the adhesive geometric boundary and convert it into a geometric centerline, and finally generate connection information based on the relevant data of adjacent components. This operation method is cumbersome and time-consuming, and due to the large number of adhesives, it is easy to make mistakes or omissions. Summary of the invention

[0004] One aspect of the present invention aims to solve the technical problem of how to extract information from the geometric topology of glue in batches in an efficient manner.

[0005] In addition, other aspects of the present invention are also intended to solve or alleviate other technical problems existing in the prior art.

[0006] The present invention provides an information extraction method for viscose modeling, a viscose modeling method, a computer-readable storage medium and a computer device. Specifically, according to one aspect of the present invention, there are provided:

[0007] An information extraction method for viscose modeling, comprising executing the following steps by a computer program:

[0008] S1: According to the geometric topology of the glue, all edges of the glue are traversed to obtain the following geometric edges, which belong to the boundary edges of the glue, and the geometric edges are correspondingly stored in the following edge groups, which are assigned to the boundary edges to which the geometric edges belong;

[0009] S2: Obtaining a geometric center line of the adhesive according to the edge group.

[0010] Optionally, according to an embodiment of the present invention, step S1 includes the following sub-steps:

[0011] S11: randomly selecting a geometric edge according to the geometric topology of the glue,

[0012] S12: Determine whether the geometric edge is an internal edge, if yes, execute step S14, if no, execute step S13;

[0013] S13: storing the geometric edge in the edge group, obtaining all other geometric edges of the boundary edge through the geometric edge and storing them in the edge group;

[0014] S14: Determine whether all edges have been traversed. If yes, execute step S2; if no, execute step S15;

[0015] S15: reselecting an unselected geometric edge according to the geometric topology of the glue, and returning to execute step S12.

[0016] Optionally, according to an embodiment of the present invention, step S13 includes the following sub-steps:

[0017] S131: storing the geometric edge into the edge group, obtaining two adjacent edges of the geometric edge as a first adjacent edge and a second adjacent edge, and simultaneously executing steps S132 and S133;

[0018] S132: Determine whether the first adjacent edge satisfies the continuous boundary condition with the geometric edge; if yes, execute step S134; if no, execute step S14;

[0019] S133: Determine whether the second adjacent edge satisfies the continuous boundary condition with the geometric edge; if yes, execute step S135; if no, execute step S14;

[0020] S134: storing the first adjacent edge into the edge group, obtaining adjacent edges of the first adjacent edge excluding the geometric edge as third adjacent edges, updating the current geometric edge to the first adjacent edge, and then updating the current first adjacent edge to the third adjacent edge, and returning to execute step S132;

[0021] S135: Store the second adjacent edge into the edge group, obtain the adjacent edge of the second adjacent edge excluding the geometric edge as the fourth adjacent edge, update the current geometric edge to the second adjacent edge, and then update the current second adjacent edge to the fourth adjacent edge, and return to execute step S133.

[0022] Optionally, according to an embodiment of the present invention, in step S131, the first vertex and the second vertex of the geometric edge are obtained, another edge with the first vertex as the vertex is obtained as the first adjacent edge of the geometric edge, and another edge with the second vertex as the vertex is obtained as the second adjacent edge of the geometric edge.

[0023] Optionally, according to an embodiment of the present invention, steps S132 and S133 respectively include the following steps:

[0024] The tangents of the corresponding adjacent edges and the geometric edges at their common vertices are respectively calculated, and it is determined whether the angle between the tangents is less than an angle threshold. If so, it is proved that the corresponding adjacent edges and the geometric edges meet the continuous boundary condition; if not, it is proved that they do not meet the condition.

[0025] Optionally, according to an embodiment of the present invention, the angle threshold is 40°.

[0026] Optionally, according to an embodiment of the present invention, the angle threshold is 30°.

[0027] Optionally, according to an embodiment of the present invention, step S2 includes the following sub-steps:

[0028] S21: Obtain two longest boundary edges from the edge group;

[0029] S22: Calculate the geometric center line through the two longest boundary edges.

[0030] Optionally, according to an embodiment of the present invention, the information extraction method further comprises the following steps:

[0031] S3: According to the geometric center line of the adhesive, read the geometric information of the adjacent components of the adhesive and generate corresponding connection information.

[0032] According to another aspect of the present invention, the present invention provides a modeling method for viscose, which includes the above-mentioned information extraction method.

[0033] According to yet another aspect of the present invention, the present invention provides a computer-readable storage medium, on which a computer program is stored, wherein the computer program implements the above-mentioned information extraction method when executed by a processor.

[0034] According to another aspect of the present invention, the present invention provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned information extraction method when executing the computer program.

[0035] The benefits of the present invention include:

[0036] 1. Automatically extract the geometric topology of viscose through algorithms, and realize batch information extraction and modeling of viscose;

[0037] 2. Traverse all geometric edges of the glue and find the geometric center line. The obtained geometric center line data is more accurate, reducing errors and omissions caused by manual operation;

[0038] 3. By using the continuous boundary algorithm to obtain the boundary edges, the two longest boundary edges can be obtained more accurately, thereby improving the accuracy of the final geometric midline. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The above and other features of the present invention will become apparent with reference to the accompanying drawings, in which:

[0040] Figure 1 A general flow chart of an information extraction method proposed according to an embodiment of the present invention is shown;

[0041] Figure 2 A schematic diagram showing the geometric topology of glue, wherein a method for extracting glue information is shown;

[0042] Figure 3 A flow chart of an information extraction method according to an embodiment of the present invention is shown, in which all sub-steps are shown. DETAILED DESCRIPTION

[0043] It is easy to understand that according to the technical solution of the present invention, without changing the essential spirit of the present invention, a person skilled in the art can propose a variety of interchangeable structural modes and implementation modes. Therefore, the following specific implementation modes and the accompanying drawings are only exemplary descriptions of the technical solution of the present invention, and should not be regarded as the whole of the present invention or as a limitation or restriction to the technical solution of the present invention.

[0044] The directional terms such as up, down, left, right, front, back, front, back, top, bottom, etc. mentioned or may be mentioned in this specification are defined relative to the structures shown in the drawings. They are relative concepts and may change accordingly according to their different positions and different usage states. Therefore, these or other directional terms should not be interpreted as restrictive terms. In addition, the terms "first", "second", "third", etc. or similar expressions are only used for description and distinction purposes, and cannot be understood as indicating or implying the relative importance of the corresponding components.

[0045] The information extraction method for viscose modeling of the present invention is mainly based on CAE modeling of viscose. In this modeling method, the CAD (Computer Aided Design) model of the viscose, that is, the geometric topology, is known. Of course, the information extraction method of the present invention can also be applied to other modeling methods of viscose, as long as it is necessary to extract information from the viscose based on the known geometric topology. The technical features and technical steps of the information extraction method of the present invention can be understood and implemented based on various computer modeling software (such as ANSA, etc.), and the required geometric information of the viscose can be obtained based on the known viscose CAD model, or geometric topology, to simplify the modeling steps and improve the modeling efficiency.

[0046] The present invention aims to innovate the main information extraction method when modeling viscose, so the specification does not involve all the operation steps and processes of the modeling method. The modeling method and process not mentioned in the specification can be learned from the prior art.

[0047] Before modeling the adhesive, the CAD model information of the adhesive, i.e., the geometric topology information of the adhesive, is stored in the modeling software. This geometric topology information is sufficient to describe the information of all geometric edges of the adhesive. When modeling the adhesive, it is necessary to extract or calculate the relevant characteristic parameters of the adhesive from this geometric topology information to achieve the effect of automatic information extraction. For the adhesive, the most critical information that needs to be obtained from the geometric topology information is the geometric center line of the adhesive. From the geometric center line, other geometric information of the adhesive and the connection information with adjacent components can be obtained. However, the geometric center line information cannot be directly obtained from the geometric topology information of the adhesive.

[0048] refer to Figure 1 , which shows a general flow chart of an information extraction method proposed according to an embodiment of the present invention. In the present invention, an information extraction method is proposed for automatically obtaining the geometric center line of the glue from the geometric topological information, comprising executing the following steps by a computer program:

[0049] S1: According to the geometric topology of the glue, all edges of the glue are traversed to obtain the following geometric edges, which belong to the boundary edges of the glue, and store the geometric edges in an edge group, which is assigned to the boundary edges to which the geometric edges belong;

[0050] S2: Obtaining a geometric center line of the adhesive according to the edge group.

[0051] S3: According to the geometric center line of the adhesive, read the geometric information of the adjacent components of the adhesive and generate corresponding connection information.

[0052] In step S1, "traversing all edges of the glue" means selecting all geometric edges in the geometric topology of the glue at least once, so that no geometric edge information is omitted. This process is automatically performed in the database of the software through an algorithm, which can reduce errors or omissions caused by manual operations.

[0053] In step S1, the concept of "boundary edge" is specifically for the commonly used long strips of adhesive, refer to Figure 2 , which shows a schematic diagram of the geometric topology of the glue. Figure 2 The black dots in the figure are only drawn schematically to indicate the vertices of the geometric edges, and the shapes of these black dots are not included in the actual glue geometric topology. It is defined here that this strip of glue has 4 boundary edges E a 、E b 、E c 、E d , that is, the two long boundary edges E that form the strip adhesive boundary b 、E d and 2 short boundary edges E a 、E c . 2 long border edges E b 、E d Basically, it defines the extension length and extension direction of the strip adhesive, so it can be passed through the two long boundary edges E b 、E d To find the geometric center line that can represent the geometric topological information of the strip of adhesive. Since the geometric topology of the long strip of adhesive is usually composed of multiple small rectangular strips of adhesive, each long boundary edge E b 、E d In geometric topology, it is divided into multiple geometric edges, and each short boundary edge E a 、E c Generally only includes one geometric edge E a 、E c Of course, a short boundary edge may also include multiple geometric edges. Therefore, in the information extraction method of the present invention, four edge groups are set, and these four edge groups are used to store four boundary edges E respectively. a 、E b 、E c 、E d All geometric edges are included.

[0054] Here, the concept of "continuous boundary" is defined. "Continuous boundary" does not include all connected edges, but only includes two edges that are connected and the angle between them is less than a certain angle value. Two geometric edges that meet the "continuous boundary" must first have a common vertex, and the angle between the tangents of the two geometric edges at this vertex (this angle represents the angle between the two edges) must be less than an angle threshold α, which will be described in detail below. This angle threshold α is usually an acute angle less than 45°. In this way, due to the four boundary edges E a 、E b 、E c 、E d The corners between them must be greater than the angle threshold α, so they do not meet the condition of being continuous boundaries with each other, that is, any of the four boundary edges does not meet the continuous boundary condition with its adjacent edge. It can be inferred that any geometric edge in one boundary edge does not meet the continuous boundary condition with any geometric edge in another boundary edge. In this way, after traversing all the edges of the glue, the geometric edges contained in the four boundary edges can be distinguished, and the four boundary edges E are obtained. a 、E b 、E c 、E d It should be noted that since the geometric topology of a long strip of viscose is usually composed of a plurality of small rectangular strips of viscose, there are two types of geometric edges in the geometric topology of viscose. One type belongs to the boundary edge E a 、E b 、E c 、E d or part of it, such as E in the figure i 、E i+1 、E i-1 , these geometric edges are pieced together to form the above boundary edge E a 、E b 、E c 、E d The long side E b 、E d (In the present invention, for better distinction, although E i 、E i+1 、E i-1 This type of edge belongs to the above boundary edge E b 、E d part of , but not called a boundary edge), and E in the figure a 、E c , which is itself the above-mentioned boundary edge; and the other geometric edge is the internal edge that is inside the geometric boundary contour of the glue due to the geometric topology formed by splicing. Figure 2The internal edge E is shown in FIG. j Of course, there can be multiple internal edges. When traversing to an internal edge, you should skip the internal edge and reselect the geometric edge, because you cannot obtain the geometric edge contained in the boundary edge by processing the internal edge. The difference between internal edges and boundary edges is that internal edges belong to the common edges of two faces in geometric topology, while boundary edges only belong to the edges of one face. This difference can be used to determine whether a geometric edge belongs to an internal edge in the algorithm.

[0055] refer to Figure 3 , which shows a flow chart of an information extraction method proposed according to an embodiment of the present invention, in which all sub-steps are shown.

[0056] Step S1 includes the following sub-steps:

[0057] S11: randomly selecting a geometric edge according to the geometric topology of the glue,

[0058] S12: Determine whether the geometric edge is an internal edge, if yes, execute step S14, if no, execute step S13;

[0059] S13: storing the geometric edge in the edge group, obtaining all other geometric edges of the boundary edge through the geometric edge and storing them in the edge group;

[0060] S14: Determine whether all edges have been traversed. If yes, execute step S2; if no, execute step S15;

[0061] S15: reselecting an unselected geometric edge according to the geometric topology of the glue, and returning to execute step S12.

[0062] Step S1 is a loop statement. In step S11, the geometric edge of the glue is randomly selected and the subsequent operation is performed. In step S12, it is determined whether the geometric edge belongs to an internal edge. If the geometric edge belongs to an internal edge, such as geometric edge / internal edge E j , then the boundary edge cannot be determined through the geometric edge, then the step of storing the geometric edge and obtaining other geometric edges of the boundary edge of the glue through the geometric edge in step S13 is skipped, and step S14 is directly executed. If the geometric edge belongs to the boundary edge or a part thereof, such as geometric edge E i, then execute step S13. In step S13, first store the geometric edge, then obtain all other geometric edges including the boundary edge of the geometric edge through the geometric edge, and store them in the corresponding edge group. Then execute step S14 to determine whether all edges have been traversed. If all edges have been traversed, directly execute step S2. If all edges have not been traversed, execute step S15, that is, select an unselected geometric edge, and then execute from S12 again to avoid selecting the same geometric edge twice. In this way, all edges of the glue can be traversed through step S1.

[0063] refer to Figure 3 , step S13 includes the following sub-steps:

[0064] S131: The geometric edge (E i ) is stored in the edge group, two adjacent edges of the geometric edge are obtained as a first adjacent edge and a second adjacent edge, and steps S132 and S133 are performed simultaneously;

[0065] S132: Determine whether the first adjacent edge satisfies the continuous boundary condition with the geometric edge; if yes, execute step S134; if no, execute step S14;

[0066] S133: Determine whether the second adjacent edge satisfies the continuous boundary condition with the geometric edge; if yes, execute step S135; if no, execute step S14;

[0067] S134: storing the first adjacent edge into the edge group, obtaining adjacent edges of the first adjacent edge excluding the geometric edge as third adjacent edges, updating the current geometric edge to the first adjacent edge, and then updating the current first adjacent edge to the third adjacent edge, and returning to execute step S132;

[0068] S135: Store the second adjacent edge into the edge group, obtain the adjacent edge of the second adjacent edge excluding the geometric edge as the fourth adjacent edge, update the current geometric edge to the second adjacent edge, and then update the current second adjacent edge to the fourth adjacent edge, and return to execute step S133.

[0069] The sub-steps of step S13 above describe in detail how to obtain other geometric edges of the boundary edge to which it belongs through a geometric edge. Figure 2 , which exemplarily shows a method for obtaining other geometric edges of a corresponding boundary edge through a geometric edge. First, in step S131, two vertices of the geometric edge are obtained, for example, Figure 2 The geometric edge is E i , whose two vertices are V i-1 、V i+1, here we call these two vertices the first vertices V i-1 and the second vertex V i+1 . Then get the first vertex V i-1 The other edge E of the vertex i-1 is the geometric edge E i The first adjacent edge E i-1 , get the second vertex V i+1 The other edge E of the vertex i+1 is the geometric edge E i The second adjacent side E i+1 Next, steps S132 and S133 are performed respectively. In step S132, the first adjacent edge E is determined. i-1 and the geometric edge E i Whether the continuous boundary condition is met, if so, step S134 is executed, that is, the first adjacent edge E i-1 Store it in the edge group accordingly and obtain the first adjacent edge E i-1 Except for the geometric edge E i The adjacent edge other than the third adjacent edge is E i-2 , update the current geometric edge to the first adjacent edge E i-1 , update the current first adjacent edge to the third adjacent edge E i-2 , and returns to step S132, that is, the first adjacent edge E is used at this time i-1 as the geometric edge and take the first adjacent edge E i-1 Another vertex V i-2 As a vertex, find the first adjacent edge E i-1 The adjacent edge E i-2 , and then continue to judge the third adjacent edge E i-2 With the first adjacent edge E i-1 Does it satisfy the continuous boundary condition? If not, then the geometric edge E i With the first adjacent edge E i-1 If the continuous boundary condition is not met, step S14 is directly executed. In step S133, it is determined that the second adjacent edge E i+1 and the geometric edge E i Whether the continuous boundary condition is met, if so, step S135 is executed, that is, the second adjacent edge E i+1 Store it into the edge group accordingly and obtain the second adjacent edge E i+1 Except for the geometric edge E i The adjacent edge E i+2 The fourth adjacent side E i+2 , update the current geometric edge to the second adjacent edge E i+1 , the current second adjacent edge E i+1 Update to the fourth adjacent edge Ei+2 , and returns to step S133, that is, the second adjacent edge E is used at this time i+1 as the geometric edge and the second adjacent edge E i+1 Another vertex V i+2 As a vertex, find the second adjacent edge E i+1 The adjacent edge E i+2 , and then continue to determine the fourth adjacent edge E i+2 With the second adjacent edge E i+1 Does it satisfy the continuous boundary condition? If not, then the geometric edge E i With the second adjacent edge E i+1 If the continuous boundary condition is not met, step S14 is directly executed.

[0070] Steps S132 and S133 respectively include the following sub-steps:

[0071] The tangents of the corresponding adjacent edges and the geometric edges at the common vertices are respectively calculated, and it is determined whether the angle between the tangents is less than the angle threshold α. If so, it is proved that the corresponding adjacent edges and the geometric edges meet the continuous boundary condition, and if not, it is proved that they do not meet the condition.

[0072] Since steps S132 and S133 are basically the same except for the first adjacent edge and the second adjacent edge respectively, those skilled in the art can undoubtedly determine to which adjacent edge the adjacent edge in the above sub-step belongs by the expression "corresponding" without any ambiguity.

[0073] In general, the determination of the continuous boundary condition is based on the angle between the tangent of the geometric edge and its adjacent edge at the common vertex of the two. Figure 2 In step S132, the geometric edge E is first obtained. i At the first vertex V i-1 The tangent line T1 at is the first tangent line T1 and the first adjacent edge E i-1 At the first vertex V i-1 The tangent line T2 is the second tangent line T2, and it is determined whether the angle between the two tangent lines is less than the angle threshold α; in step S133, the geometric edge E is first obtained. i At the second vertex V i+1 The tangent line T3 at is the third tangent line T3 and the second adjacent edge E i+1 At the second vertex V i+1 The tangent line T4 at is the fourth tangent line T4, and it is determined whether the angle between the two tangent lines is less than the angle threshold α.

[0074] It should be emphasized that the angles between the first tangent line T1 and the second tangent line T2, and between the third tangent line T3 and the fourth tangent line T4 mentioned here refer to angles between straight lines that are less than or equal to 90°, rather than angles that are greater than 90°. The angle threshold α is preset in advance, and the angle threshold α is, for example, 40°, preferably 30°. The principle of this determination method is that in the geometric topology of the general strip adhesive, the long boundary edge E b 、E d and the short boundary edge E a 、E c The angle between the tangent lines at their common vertex is greater than the angle threshold α, for example, greater than 40°. b 、E d The angle between the tangents of the included geometric edges at their common vertices is less than the angle threshold α, for example, less than 40°, so it can be determined whether the geometric edge and its adjacent edges belong to the same long boundary edge. The condition that the angle between the tangents of the geometric edge and its adjacent edges at the common vertex is less than the angle threshold α is called the continuous boundary condition. The geometric edges that meet the continuous boundary condition belong to the same long boundary edge E. b 、E d By determining the continuous boundary, all geometric edges belonging to a boundary edge can be accurately obtained from the geometric topology of the glue without obtaining these edges through manual visual inspection.

[0075] Step S2 includes the following sub-steps:

[0076] S21: Obtain two longest boundary edges from the edge group;

[0077] S22: Calculate the geometric center line through the two longest boundary edges.

[0078] In step S21, two edge groups with the longest total length are obtained from four edge groups that respectively contain all geometric edges of the corresponding boundary edges. Figure 2 The edge E b 、E d All geometric edges of b 、E d , and in step S22, through these two boundary edges E b 、E d Find the geometric center line of the glue, this step can be done automatically by software.

[0079] Finally, in step S3, the geometric information of the adjacent components of the adhesive is read through the geometric center line of the adhesive and the corresponding connection information is generated. At this point, the information extraction method of the present invention ends.

[0080] When there are multiple glue geometric topologies in the software, the geometric topology of each glue can be traversed separately, that is, the above information extraction method can be implemented on the geometric topology of each glue, so as to realize batch information extraction of glue without manually modeling glue one by one, thereby improving the efficiency of modeling.

[0081] According to another aspect of the present invention, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps of the above-mentioned information processing method are implemented.

[0082] The computer-readable storage medium may include: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and other media that can store program codes.

[0083] For an introduction to the computer-readable storage medium provided by the present invention, please refer to the above method embodiment, and the present invention will not elaborate on it here.

[0084] According to another aspect of the present invention, a computer device is provided, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the above-mentioned information extraction method when executing the computer program.

[0085] It should be understood that all the above preferred embodiments are illustrative rather than restrictive, and various modifications or variations made by those skilled in the art to the specific embodiments described above under the concept of the present invention should be within the legal protection scope of the present invention.

Claims

1. An information extraction method for viscose modeling, characterized in that: The method comprises executing the following steps by means of a computer program: S1: According to the geometric topology of the glue, all edges of the glue are traversed to obtain the following geometric edges, which belong to the boundary edges of the glue, and store the geometric edges into the following edge groups, which are assigned to the boundary edges to which the geometric edges belong; S2: obtaining a geometric center line of the adhesive according to the edge group; Wherein, step S1 includes the following sub-steps: S11: randomly selecting a geometric edge according to the geometric topology of the glue, S12: Determine whether the geometric edge is an internal edge, if yes, execute step S14, if no, execute step S13; S13: storing the geometric edge in the edge group, obtaining all other geometric edges of the boundary edge through the geometric edge and storing them in the edge group; S14: Determine whether all edges have been traversed. If yes, execute step S2; if no, execute step S15; S15: reselecting an unselected geometric edge according to the geometric topology of the adhesive, and returning to step S12; Wherein, step S13 includes the following sub-steps: S131: storing the geometric edge into the edge group, obtaining two adjacent edges of the geometric edge as a first adjacent edge and a second adjacent edge, and simultaneously executing steps S132 and S133; S132: Determine whether the first adjacent edge satisfies the continuous boundary condition with the geometric edge; if yes, execute step S134; if no, execute step S14; S133: Determine whether the second adjacent edge satisfies the continuous boundary condition with the geometric edge; if yes, execute step S135; if no, execute step S14; S134: storing the first adjacent edge into the edge group, obtaining adjacent edges of the first adjacent edge excluding the geometric edge as third adjacent edges, updating the current geometric edge to the first adjacent edge, and then updating the current first adjacent edge to the third adjacent edge, and returning to execute step S132; S135: Store the second adjacent edge into the edge group, obtain the adjacent edge of the second adjacent edge excluding the geometric edge as the fourth adjacent edge, update the current geometric edge to the second adjacent edge, and then update the current second adjacent edge to the fourth adjacent edge, and return to execute step S133.

2. The information extraction method according to claim 1, characterized in that: In step S131, the first vertex and the second vertex of the geometric edge are obtained, another edge with the first vertex as a vertex is obtained as the first adjacent edge of the geometric edge, and another edge with the second vertex as a vertex is obtained as the second adjacent edge of the geometric edge.

3. The information extraction method according to claim 2, characterized in that: Steps S132 and S133 respectively include the following steps: The tangents of the corresponding adjacent edges and the geometric edges at their common vertices are respectively calculated, and it is determined whether the angle between the tangents is less than an angle threshold. If so, it is proved that the corresponding adjacent edges and the geometric edges meet the continuous boundary condition; if not, it is proved that they do not meet the condition.

4. The information extraction method according to claim 3, characterized in that: The angle threshold is 40°.

5. The information extraction method according to claim 3, characterized in that: The angle threshold is 30°.

6. The information extraction method according to claim 1, characterized in that: Step S2 includes the following sub-steps: S21: Obtain two longest boundary edges from the edge group; S22: Calculate the geometric center line through the two longest boundary edges.

7. The information extraction method according to claim 1, characterized in that: The following steps are also included: S3: According to the geometric center line of the adhesive, read the geometric information of the adjacent components of the adhesive and generate corresponding connection information.

8. A method for modeling viscose, characterized in that: The method comprises the information extraction method according to any one of claims 1 to 7.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the information extraction method according to any one of claims 1 to 7 is implemented.

10. A computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the information extraction method according to any one of claims 1 to 7 is implemented.

Images