Method, system and related device for automated modeling of rigid body connections

Abstract

The present invention provides a method, system and related devices for automatic modeling of rigid body connections. The method includes the following steps: identifying hole features of a model where a rigid body connection needs to be established, and obtaining all boundary nodes of the hole; obtaining boundary units adjacent to the boundary nodes based on topological relationships; obtaining boundary edges corresponding to the boundary units based on topological relationships; generating boundary curves from the boundary edges, and sorting the boundary curves so that they are connected into closed curves.

Description

Technical Field

[0001] The present invention relates to the technical field of collision simulation modeling, and in particular to a method for automated modeling of rigid body connections, a system for automated modeling of rigid body connections, and related devices. Background Art

[0002] There are many connection methods in vehicle simulation models. For crash safety CAE simulation models, rigid body connections are often used instead of bolt and nut connections. This is particularly true for the bolt and nut connections between vehicle subsystems and between subsystems and the body-in-white (BIW). Traditionally, rigid body connections in simulation models are manually created one by one by engineers. This process is tedious and time-consuming due to the large number of rigid body connections required. Summary of the Invention

[0003] One aspect of the present invention aims to solve the technical problem of how to efficiently and batch-wise implement modeling of rigid sheets.

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

[0005] The present invention provides a method, system and related apparatus for automated modeling of rigid body connections. Specifically, according to one aspect of the present invention, it provides:

[0006] A method for automated modeling of rigid body connections, comprising the following steps:

[0007] Identify hole features of the model that requires rigid body connection, and obtain all boundary nodes of the hole;

[0008] Acquire boundary cells adjacent to the boundary node according to the topological relationship;

[0009] Acquire a boundary edge corresponding to the boundary unit according to a topological relationship;

[0010] Boundary curves are generated from the boundary edges, and the boundary curves are sorted so as to be connected to form closed curves.

[0011] Optionally, according to an embodiment of the present invention, after generating boundary curves from the boundary edges, all boundary curves are traversed, and adjacent boundary curves are found and connected during the traversal process.

[0012] Optionally, according to an embodiment of the present invention, after generating a boundary curve from the boundary edge, the following steps are included:

[0013] Put all boundary curves into the input edge group;

[0014] Selecting a boundary curve from the input edge group as a basic boundary curve;

[0015] Selecting a boundary curve different from the basic boundary curve from the input edge group as a test boundary curve;

[0016] Determine whether the base boundary curve and the test boundary curve are adjacent. If so, place the base boundary curve from the input edge group into the output edge group, use the test boundary curve as the current base boundary curve, and then re-execute the previous step. If not, directly re-execute the previous step.

[0017] Optionally, according to one embodiment of the present invention, before selecting the test boundary curve, a vertex of the basic boundary curve is obtained as the first vertex, and the method for judging whether the basic boundary curve and the test boundary curve are adjacent is to obtain two vertices of the test boundary curve as the second vertex and the third vertex, and judge whether one of the second vertex and the third vertex coincides with the first vertex. If not, it proves that the basic boundary curve and the test boundary curve are not adjacent. If so, it proves that the basic boundary curve and the test boundary curve are adjacent, and the vertex of the second vertex and the third vertex that does not coincide with the first vertex is updated to the current first vertex.

[0018] Optionally, according to an embodiment of the present invention, the following steps are performed before determining whether the base boundary curve and the test boundary curve are adjacent:

[0019] Traverse all boundary curves in the input edge group to determine whether there is a boundary curve adjacent to the basic boundary curve. If not, directly output the output edge group. If so, continue to execute the step of determining whether the basic boundary curve and the test boundary curve are adjacent.

[0020] According to another aspect of the present invention, a system for automatic modeling of rigid body connections is provided, which comprises

[0021] Identification module, used to identify hole features of models that require rigid body connections;

[0022] A calculation module, configured to obtain all boundary nodes of the hole, and obtain boundary cells adjacent to the boundary nodes and boundary edges corresponding to the boundary cells according to topological relationships;

[0023] A geometry module, configured to generate a boundary curve from the boundary edge;

[0024] The sorting module is used to sort the boundary curves so as to connect them into closed curves.

[0025] Optionally, according to an embodiment of another aspect of the present invention, the sorting module traverses all boundary curves, and searches for adjacent boundary curves and connects them during the traversal process.

[0026] Optionally, according to an embodiment of another aspect of the present invention, the sorting module processes the boundary curve as follows:

[0027] Put all boundary curves into the input edge group;

[0028] Selecting a boundary curve from the input edge group as a basic boundary curve;

[0029] Selecting a boundary curve different from the basic boundary curve from the input edge group as a test boundary curve,

[0030] Determine whether the base boundary curve and the test boundary curve are adjacent. If so, place the base boundary curve from the input edge group into the output edge group, and use the test boundary curve as the current base boundary curve, then re-execute the previous step. If not, directly re-execute the previous step.

[0031] Optionally, according to an embodiment of another aspect of the present invention, the sorting module obtains a vertex of the basic boundary curve as the first vertex before selecting the test boundary curve. The sorting module determines whether the basic boundary curve and the test boundary curve are adjacent by obtaining two vertices of the test boundary curve as the second vertex and the third vertex, and determining whether one of the second vertex and the third vertex coincides with the first vertex. If not, it proves that the basic boundary curve and the test boundary curve are not adjacent. If so, it proves that the basic boundary curve and the test boundary curve are adjacent, and the vertex of the second vertex and the third vertex that does not coincide with the first vertex is updated to the current first vertex.

[0032] Optionally, according to an embodiment of another aspect of the present invention, the sorting module further performs the following processing on the boundary curve before determining whether the basic boundary curve and the test boundary curve are adjacent:

[0033] Traverse all boundary curves in the input edge group to determine whether there is a boundary curve adjacent to the basic boundary curve. If not, directly output the output edge group. If so, continue to execute the step of determining whether the basic boundary curve and the test boundary curve are adjacent.

[0034] According to another aspect of the present invention, the present invention provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the method for automatic modeling of rigid body connections described above is implemented.

[0035] According to another aspect of the present invention, the present invention provides a computer device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the above-mentioned method for automated modeling of rigid body connections when executing the computer program.

[0036] The benefits of the present invention include: realizing automatic batch modeling of rigid sheets by automatically identifying the hole features of the finite element model, finally determining the boundary curves of the holes and sorting and connecting them into rings. The modeling adopts a fully automated form, and there is no need for manual operation of the modeling of the rigid sheets. During the modeling process, the boundary curves of the holes are traversed to obtain all the boundary curves and sort them into rings, which reduces human errors and achieves a more accurate modeling method. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0038] Figure 1 A schematic diagram showing the structure of a hole in a model requiring a rigid body connection, wherein the geometric features of the hole are shown;

[0039] Figure 2 A schematic flow chart of a method for automatic modeling of rigid body connections according to one embodiment of the present invention is shown;

[0040] Figure 3 A schematic structural diagram of a system for automatic modeling of rigid body connections proposed according to one embodiment of the present invention is shown. DETAILED DESCRIPTION

[0041] 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 embodiments and drawings are only exemplary descriptions of the technical solution of the present invention and should not be regarded as the entire invention or as a limitation or restriction of the technical solution of the present invention.

[0042] The terms "up," "down," "left," "right," "front," "back," "front," "back," "top," and "bottom" mentioned or potentially mentioned in this specification are defined relative to the structures shown in the accompanying drawings. They are relative concepts and may vary depending on their location or usage. Therefore, these or other directional terms should not be interpreted as restrictive. In addition, the terms "first," "second," "third," and similar expressions are used only for descriptive and distinguishing purposes and should not be understood to indicate or imply the relative importance of the corresponding components.

[0043] refer to Figure 1 , which shows a schematic diagram of the structure of the holes in the model that need to establish rigid body connections. Figure 1 For example, the decagon in the center is the hole of the model that needs to establish a rigid connection, that is, the decagon surrounds a hollow space. In practical applications, the subsystem or part of the entity corresponding to the model is connected to other subsystems or the body through bolts and nuts through the hole. However, when modeling, it is necessary to model the area of the hole with a rigid piece to achieve a rigid connection. The following features are defined here to define the outline of the hole (for example Figure 1 The vertices of the decagon in the hole are defined as the boundary nodes of the hole (such as Figure 1 b in 11 、b 12 etc.); Figure 1 The other solid polygons (i.e. polygons other than decagons) in the Figure 1 a and a1 in ); define the modeling unit adjacent to the hole as a boundary unit (such as Figure 1 a1 in the figure); define the modeling unit with the boundary node as the vertex as the boundary unit adjacent to the boundary node (e.g. a1 is the boundary unit adjacent to b 11 adjacent boundary cells); define the common edge of the boundary cell and the hole outline as the boundary edge corresponding to the boundary cell (such as Figure 1 b1 in the figure is the boundary edge corresponding to boundary element a1); it should be understood that the aforementioned boundary nodes, boundary elements, and boundary edges are topological concepts, while the concept of "boundary curve" is defined as the geometric concept of boundary edges. The process of generating boundary curves from boundary edges is the process of geometricizing boundary edges in topology. To facilitate the description of the figures, boundary edges and their corresponding boundary curves use the same reference numerals. In addition, the concept of "adjacent boundary curves" refers to boundary curves that have a common vertex.

[0044] refer to Figure 2 , which shows a flow chart of a method for automatic modeling of rigid body connections according to one embodiment of the present invention. The method comprises the following steps:

[0045] Identify hole features of the model that requires rigid body connection, and obtain all boundary nodes of the hole;

[0046] Acquire boundary cells adjacent to the boundary node according to the topological relationship;

[0047] Acquire a boundary edge corresponding to the boundary unit according to a topological relationship;

[0048] Boundary curves are generated from the boundary edges, and the boundary curves are sorted so as to be connected to form closed curves.

[0049] In this method, the hole features in the model must first be identified, that is, the topological relationships and geometric positions of the hole features are determined. All boundary nodes of the hole are then retrieved. Based on the topological relationships, boundary cells adjacent to the boundary nodes, i.e., boundary cells with the boundary nodes as vertices, can be retrieved. It should be understood that a boundary node should have two adjacent boundary cells. After obtaining all boundary cells through all boundary nodes, each boundary cell has its duplicate boundary cells. However, in this method, duplicate boundary cells are not counted or deleted. After obtaining the boundary cells, the boundary edges corresponding to the boundary cells are obtained based on the topological relationships, i.e., the common edges between the boundary cells and the hole outline. Finally, boundary curves are generated from these boundary edges. This involves converting the boundary edges from topological features into geometric features, and then sorting and connecting them into a closed curve. This closed curve represents the specific geometric shape of the hole, thus achieving accurate modeling of the hole. The term "closed curve" here refers to a curve that is connected end to end and resembles a ring. This closed curve does not necessarily have to be a ring; it can also have other ring-like shapes.

[0050] In one embodiment of the present invention, after generating boundary curves from boundary edges, all boundary curves are traversed. During the traversal, adjacent boundary curves are found and connected. Here, "adjacent boundary curves" refer to boundary curves with common vertices, and "connecting" means finding two boundary curves with common vertices and geometrically connecting them into a single boundary curve. This ultimately yields a closed-loop hole contour curve.

[0051] In one embodiment of the present invention, after generating a boundary curve from the boundary edge, the following steps are included:

[0052] Put all boundary curves into the input edge group;

[0053] Selecting a boundary curve from the input edge group as a basic boundary curve;

[0054] Selecting a boundary curve different from the basic boundary curve from the input edge group as a test boundary curve,

[0055] Determine whether the base boundary curve and the test boundary curve are adjacent. If so, place the base boundary curve from the input edge group into the output edge group, and use the test boundary curve as the current base boundary curve, then re-execute the previous step. If not, directly re-execute the previous step.

[0056] After obtaining all boundary curves, they are first placed in an input edge group, and the traversal process for all boundary curves in the input edge group is completed. First, an edge is selected as a base boundary curve. In other words, the boundary curves adjacent to it are obtained based on this boundary curve. Specifically, a boundary curve different from the base boundary curve is selected as a test boundary curve. It is then determined whether the base boundary curve and the test boundary curve are adjacent. If so, the base boundary curve is placed in the output edge group, and the test boundary curve is used as the current base boundary curve. A boundary curve different from the current base boundary curve is then reselected as the test boundary curve and tested against the current base boundary curve. If not, a boundary curve different from the base boundary curve is directly reselected as the test boundary curve until the test boundary curve and the base boundary curve are adjacent. In this way, the boundary curves are placed in the output edge group in the order in which they are connected. Ultimately, all boundary curves in the output edge group are connected to form a closed curve, which is the contour line of the hole. The boundary curves placed in the output edge group will no longer exist in the input edge group. Therefore, when all boundary curves are finally placed in the output edge group, there will be no boundary curves in the input edge group. At this time, no curves can be selected from the input edge group, that is, the step of selecting and testing boundary curves can no longer be executed, which means that the loop will terminate.

[0057] In one embodiment of the present invention, before selecting the test boundary curve, a vertex of the basic boundary curve is obtained as the first vertex, and the method for judging whether the basic boundary curve and the test boundary curve are adjacent is to obtain two vertices of the test boundary curve as the second vertex and the third vertex, and judge whether one of the second vertex and the third vertex coincides with the first vertex. If not, it proves that the basic boundary curve and the test boundary curve are not adjacent. If so, it proves that the basic boundary curve and the test boundary curve are adjacent, and the vertex of the second vertex and the third vertex that does not coincide with the first vertex is updated to the current first vertex.

[0058] Reference again Figure 1 For example, b1 is the basic boundary curve, b2 is the test boundary curve, and before selecting the test boundary curve, first obtain the vertex b of b1 12 As the first vertex, when making a judgment, get the two vertices b of b2 21 and b 22 For the second and third vertices, then for b 21 and b 22 Is there a vertex in b that is 12 Overlap is determined, Figure 1 In the middle, you can see b 21 with b 12 coincide, which proves that the basic boundary curve b1 and the test boundary curve b2 are adjacent. 22Update to the current first vertex, and then select the test boundary curve again. This time, let b3 be the new test boundary curve. At this time, the second and third vertices are b 31 and b 32 , then judge b again 31 and b 32 Is there a vertex in b that is 22 Overlap, now you can see b 31 and b 22 coincide, which proves that the basic boundary curve b2 and the test boundary curve b3 are adjacent. 32 Update to the current first vertex, and the same applies to other basic boundary curves adjacent to the test boundary curve. Conversely, if b1 is the basic boundary curve, and b3 is selected as the test boundary curve when the test boundary curve is selected for the first time, take the vertex b of b1 12 is the first vertex, the two vertices b of b3 31 and b 32 is the second and third vertex, and b is visible at this time 31 and b 32 Neither 12 If the test boundary curve coincides with the first vertex b, the test boundary curve should be reselected until a curve with the same 12 The coincident vertex b 21 Until the boundary curve b2.

[0059] In one embodiment of the present invention, the following steps are performed before determining whether the base boundary curve and the test boundary curve are adjacent:

[0060] Traverse all boundary curves in the input edge group to determine whether there is a boundary curve adjacent to the basic boundary curve. If not, directly output the output edge group. If so, continue to execute the step of determining whether the basic boundary curve and the test boundary curve are adjacent.

[0061] In this embodiment, before determining whether the basic boundary curve and the test boundary curve are adjacent, all boundary curves in the input edge group are first traversed to determine whether there is a boundary curve adjacent to the basic boundary curve in the input edge group. If there is no boundary curve adjacent to the basic boundary curve in the input edge group, it means that all boundary curves forming the hole contour have been placed in the output edge group. At this time, the output edge group can be directly output. If there is a boundary curve adjacent to the basic boundary curve in the input edge group, it proves that there is still a boundary curve of the hole contour that has not been placed in the output edge group. At this time, the step of determining whether the basic boundary curve and the test boundary curve are adjacent is still performed.

[0062] It should be understood that in some models, there are special cases where the boundary curves in the input edge group may also include curves that do not belong to the hole outline. These curves do not have adjacent boundary curves and cannot be connected to form a closed curve. If these curves are selected as the basic boundary curves, the number of boundary curves in the final output edge group will be less than the number of input curves, and the boundary curves in the output edge group cannot be connected to form a closed curve. In this case, it is necessary to ignore this output edge group because the boundary curves in this output edge group do not meet the conditions of the hole feature and cannot be used to model rigid body connections.

[0063] refer to Figure 3 , which shows a schematic structural diagram of a system 1000 for automated modeling of rigid body connections, according to one embodiment of the present invention. Since the specific shapes and internal structures of the various components are not the subject of the present invention, for the sake of clarity and simplicity, all of these components are schematically presented in the form of structural modules. Those skilled in the art can, with the guidance of the structural diagram, select appropriate module shapes and structural forms. Furthermore, the structural diagram provided is an embodiment of the present invention. Those skilled in the art can make various modifications to the diagram without departing from the spirit of the present invention, and such modifications should also fall within the scope of protection of the present invention.

[0064] A system 1000 for automated modeling of rigid body connections, as provided in one embodiment of the present invention, includes:

[0065] Identification module 100, used to identify hole features of the model that requires rigid body connection;

[0066] The calculation module 200 is used to obtain all boundary nodes of the hole, and obtain boundary cells adjacent to the boundary nodes and boundary edges corresponding to the boundary cells based on topological relationships;

[0067] A geometry module 300 is configured to generate a boundary curve from the boundary edge;

[0068] The sorting module 400 is configured to sort the boundary curves so as to connect them into closed curves.

[0069] The process of sorting and connecting the boundary curves is performed in the sorting module 400. The sorting module 400 traverses all boundary curves, searches for adjacent boundary curves and connects them during the traversal process. Specifically, the sorting module processes the boundary curves as follows:

[0070] Put all boundary curves into the input edge group;

[0071] Selecting a boundary curve from the input edge group as a basic boundary curve;

[0072] Selecting a boundary curve different from the basic boundary curve from the input edge group as a test boundary curve,

[0073] Determine whether the base boundary curve and the test boundary curve are adjacent. If so, move the base boundary curve from the input edge group to the output edge group, and use the test boundary curve as the current base boundary curve, then re-execute the previous step. If not, directly re-execute the previous step.

[0074] In one embodiment of the present invention, the sorting module 400 obtains a vertex of the basic boundary curve as the first vertex before selecting the test boundary curve. The sorting module 400 determines whether the basic boundary curve and the test boundary curve are adjacent by obtaining two vertices of the test boundary curve as the second vertex and the third vertex, and determining whether one of the second vertex and the third vertex coincides with the first vertex. If not, it proves that the basic boundary curve and the test boundary curve are not adjacent. If so, it proves that the basic boundary curve and the test boundary curve are adjacent, and the vertex of the second vertex and the third vertex that does not coincide with the first vertex is updated to the current first vertex.

[0075] In one embodiment of the present invention, the sorting module 400 further performs the following processing on the boundary curves before determining whether the basic boundary curve and the test boundary curve are adjacent:

[0076] Traverse all boundary curves in the input edge group to determine whether there is a boundary curve adjacent to the basic boundary curve. If not, directly output the output edge group. If so, continue to execute the step of determining whether the basic boundary curve and the test boundary curve are adjacent.

[0077] The system for automated modeling of rigid body connections is built based on the above-mentioned method for automated modeling of rigid body connections, and since the various steps of the method for automated modeling of rigid body connections have been described in great detail in the previous article, the functions and operating steps of each module can refer to the description of the corresponding parts above. Those skilled in the art can also add, modify or delete some components of the system according to the actual execution of the method for automated modeling of rigid body connections, which will not be repeated here.

[0078] 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 method for automatic modeling of rigid body connections are implemented.

[0079] 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, etc., which can store program codes.

[0080] 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.

[0081] According to another aspect of the present invention, a computer device is also provided, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the steps of the above-mentioned method for automated modeling of rigid body connections are implemented.

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

Claims

1. A method for automated modeling of rigid body connections, characterized in that: The steps include: Identify hole features of the model that requires rigid body connection, and obtain all boundary nodes of the hole; Acquire boundary cells adjacent to the boundary node according to the topological relationship; Acquire a boundary edge corresponding to the boundary unit according to a topological relationship; Generating boundary curves from the boundary edges, and sorting the boundary curves so as to connect them into closed curves; After generating boundary curves from the boundary edges, all boundary curves are traversed, and adjacent boundary curves are found and connected during the traversal process; After generating a boundary curve from the boundary edge, the following steps are included: Put all boundary curves into the input edge group; Selecting a boundary curve from the input edge group as a basic boundary curve; Selecting a boundary curve different from the basic boundary curve from the input edge group as a test boundary curve; Determine whether the basic boundary curve and the test boundary curve are adjacent. If so, place the basic boundary curve from the input edge group into the output edge group, use the test boundary curve as the current basic boundary curve, and then re-execute the previous step. If not, directly re-execute the previous step.

2. The method for automatic modeling of rigid body connections according to claim 1, characterized in that: Before selecting the test boundary curve, a vertex of the basic boundary curve is obtained as the first vertex. The method for judging whether the basic boundary curve and the test boundary curve are adjacent is to obtain two vertices of the test boundary curve as the second vertex and the third vertex, and judge whether one of the second vertex and the third vertex coincides with the first vertex. If not, it proves that the basic boundary curve and the test boundary curve are not adjacent. If so, it proves that the basic boundary curve and the test boundary curve are adjacent, and the vertex of the second vertex and the third vertex that does not coincide with the first vertex is updated to the current first vertex.

3. The method for automatic modeling of rigid body connections according to claim 1, wherein: Before determining whether the base boundary curve and the test boundary curve are adjacent, perform the following steps: Traverse all boundary curves in the input edge group to determine whether there is a boundary curve adjacent to the basic boundary curve. If not, directly output the output edge group. If so, continue to execute the step of determining whether the basic boundary curve and the test boundary curve are adjacent.

4. A system (1000) for automated modeling of rigid body connections, characterized in that: include An identification module (100) is used to identify hole features of a model requiring rigid body connection; A calculation module (200) is used to obtain all boundary nodes of the hole, and obtain boundary units adjacent to the boundary nodes and boundary edges corresponding to the boundary units based on topological relationships; A geometry module (300) for generating a boundary curve from the boundary edge; A sorting module (400) is used to sort the boundary curves so as to connect them into a closed curve; The sorting module (400) traverses all boundary curves, and searches for adjacent boundary curves during the traversal process and connects them; The sorting module (400) processes the boundary curve as follows: Put all boundary curves into the input edge group; Selecting a boundary curve from the input edge group as a basic boundary curve; Selecting a boundary curve different from the basic boundary curve from the input edge group as a test boundary curve, Determine whether the base boundary curve and the test boundary curve are adjacent. If so, place the base boundary curve from the input edge group into the output edge group, and use the test boundary curve as the current base boundary curve, then re-execute the previous step. If not, directly re-execute the previous step.

5. The system (1000) for automatic modeling of rigid body connections according to claim 4, characterized in that: The sorting module (400) obtains a vertex of the basic boundary curve as the first vertex before selecting the test boundary curve. The sorting module (400) determines whether the basic boundary curve and the test boundary curve are adjacent in the following manner: obtaining two vertices of the test boundary curve as the second vertex and the third vertex, and determining whether one of the second vertex and the third vertex coincides with the first vertex. If not, it is proved that the basic boundary curve and the test boundary curve are not adjacent. If so, it is proved that the basic boundary curve and the test boundary curve are adjacent, and the vertex of the second vertex and the third vertex that does not coincide with the first vertex is updated to the current first vertex.

6. The system (1000) for automatic modeling of rigid body connections according to claim 4, characterized in that: The sorting module (400) further performs the following processing on the boundary curve before determining whether the basic boundary curve and the test boundary curve are adjacent: Traverse all boundary curves in the input edge group to determine whether there is a boundary curve adjacent to the basic boundary curve. If not, directly output the output edge group. If so, continue to execute the step of determining whether the basic boundary curve and the test boundary curve are adjacent.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for automatic modeling of rigid body connections according to any one of claims 1 to 3 is implemented.

8. 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 method for automatic modeling of rigid body connections according to any one of claims 1 to 3 is implemented.

Images