Large-scale water surface JT target characteristic rapid modeling method

Abstract

The invention discloses a large water surface JT target characteristic rapid modeling method, and relates to the technical field of water surface JT modeling and target characteristic analysis. The method comprises the following steps: S1, on the basis of geometrical characteristics and functional requirements of a JT structural slab and a structural slab accessory, defining geometrical shapes, relationships, physical properties and material properties of a structure through parameterization; s2, developing a three-dimensional constraint solution algorithm according to the geometrical relationship of the JT structure in the S1; s3, dividing the structural slab into panels on the basis of the constraint satisfaction model in the S2, and establishing a panel relation graph to generate a panel structure model; s4, performing mesh generation on the panel in the S3 and inheriting attributes of a structure model, so that a structure finite element model is automatically generated; by the adoption of the large water surface JT target characteristic rapid modeling method, the target model meeting the structural characteristic requirement is rapidly generated, and the combat simulation and design optimization efficiency is improved.

Description

Technical Field

[0001] The invention relates to the technical field of surface JT modeling and target characteristic analysis, and in particular to a large-scale surface JT target characteristic rapid modeling method. Background Art

[0002] Large surface JT (i.e., warship) is an important equipment for maritime operations, with complex structure and diverse functions. The purpose of JT target characteristic modeling is to evaluate its combat capability, optimize structural design, and support related applications. However, traditional methods require complex geometric modeling and manual attribute definition, which leads to low modeling efficiency and inconvenience in quickly adjusting the model to adapt to dynamic needs.

[0003] The existing finite element modeling methods are mainly oriented towards general structures, and it is difficult to take into account the parametric design and geometric characteristics requirements of JT models. At the same time, large-scale JT target modeling often involves complex geometric constraint solving, and there is a lack of effective solutions. Therefore, there is an urgent need for a fast modeling method for large-scale surface JT to achieve automatic association and efficient update of geometric and physical characteristic data. Summary of the invention

[0004] The purpose of the present invention is to provide a method for rapid modeling of large surface JT target characteristics, which can quickly generate a target model that meets the structural characteristics requirements through parametric modeling, constraint solving and finite element analysis technology, so as to improve the efficiency of combat simulation and design optimization.

[0005] To achieve the above object, the present invention provides a method for rapid modeling of large surface JT target characteristics, comprising the following steps:

[0006] S1. Define the geometry, relationships, physical properties and material properties of the structure through parameterization based on the geometric characteristics and functional requirements of the JT structural plate and structural plate accessories;

[0007] S2, develop a three-dimensional constraint solving algorithm based on the geometric relationship of the JT structure in S1;

[0008] S3, based on the constraint satisfaction model in S2, the structural plate is divided into panels, and a panel relationship diagram is established to generate a panel structure model;

[0009] S4. Mesh the panel of S3 and inherit the properties of the structural model so that the structural finite element model is automatically generated.

[0010] Preferably, the JT structure in S1 is mainly composed of a structural plate and a structural plate with accessories, and the specific process of its parametric modeling is as follows:

[0011] S11, parametric modeling of the structural plate in JT;

[0012] S12. Parametrically model the structural plate with attachments in JT and manage the shape or position of the attachments of the structural plate.

[0013] Preferably, the algorithm of the three-dimensional solver in S2 is as follows:

[0014] S21, PL = {(p1, b1),…, (p n ,b n )}, PL is the plate set of all structural plates in the structural model, where n is the number of plates, p i is the base surface of the structural plate, b i is the boundary of the structural plate, i = 1, 2, ..., n;

[0015] S22, find the base plane construction sequence Q = {q1, q2, ..., q n}, where q i ∈PL,q j The base surface is not q i , j = 1, 2, ..., n;

[0016] S23. Calculate the geometry of the base plane of all structural plates, where there are no closed constraints, q i The base plane does not depend on any other plane. If all {q1,…,q i-1}, then q i It can be done by {q1,…,q i-1}Calculate;

[0017] S24, find the boundary construction sequence S = {s1, s2, ..., s n}, where s i ∈PL,s j The base surface is not s i The predecessor entity of , j∈(i,n);

[0018] S25, calculating the bounded plane of each structural plate by simultaneously solving the base surface and the boundary of each structural plate, and the bottom surface is calculated as described in S23;

[0019] S26. The undetermined part of the structural plate is the boundary. Since there is no closed constraint in the boundary, s i The boundaries of the plate do not depend on any other structural plate.

[0020] Preferably, the attachments of the structural plate are provided with constraints, and the three constraints of the attachments are as follows:

[0021] Subordinate constraints: make attachments subordinate to the structural plate, ensuring that attachments are moved, copied, and deleted together with the structural plate to which they belong;

[0022] Boundary constraint: The attachment is bounded by the structural plate and is extended or trimmed according to the structural plate;

[0023] Distance constraint: The distance between the attachment and the structural plate boundary satisfies a certain equation.

[0024] Preferably, S31, obtaining a plate set intersecting with the target structural plate and the intersection points of the target structural plate and each structural plate in the intersecting plate set and saving the intersection points in a curve set;

[0025] S32, in the intersection curve set, mutually obtain all intersection points of the curves, and save them in the intersection set;

[0026] S33, segmenting all the curves in the intersection curve set with the intersection points in the intersection point set, and creating a new curve segment set;

[0027] S34, using the points in the intersection set as vertices V and the curves in the intersection set as edges E, create an undirected connected graph G = (V, E), where G is a relationship graph;

[0028] S35. Based on the panel search algorithm, the minimum cycle of G is searched to solve the problem of creating a panel structure model.

[0029] Preferably, the panel search algorithm process in S35 is as follows:

[0030] S351. Create adjacency matrix M n×n , where n is the number of vertices, M i,j , i∈(1,n),j∈(1,n) not only indicates whether there is an edge between vertices i and j, but also indicates the number of times the corresponding edge needs to be searched. For each element in M, it corresponds to an edge in G. Assuming that there is no more than one edge between any two vertices, if there is an edge between nodes i and j, then M is first searched. i,j Set to 2, otherwise set to 0;

[0031] S352, perform a maximum loop search, starting from V0, where the X coordinate and Y coordinate are the largest among all vertices, E0 is the first edge to be searched, this edge is associated with the smallest angle between V0 and the X coordinate, if an edge is searched, the corresponding element in M ​​should be reduced by 1, let V i is the current vertex, E i is the current edge, E s For V i The set of related active edges. An active edge is an edge that has been searched less than twice. The corresponding element of an active edge in M ​​is 1 or 2. The next edge E i+1 YesE s Zhong and E i The direction angle is the smallest one, which is the angle between the tangents of the two sides at V iThe next vertex is E i+1 The other end of the search continues until V0 is searched again, completing the maximum cycle search;

[0032] S353, perform a minimum loop search, starting from V0, where the X and Y coordinates are the largest among all vertices, E0 is the first edge to be searched, this edge is associated with the smallest angle between V0 and the X coordinate, if an edge is searched, the corresponding element in M ​​should be reduced by 1, let V i is the current vertex, E i is the current edge, E s For V i The set of related active edges. An active edge is an edge that has been searched less than twice. The corresponding element of an active edge in M ​​is 1 or 2. The next edge E i+1 YesE s Zhong and E i The direction angle is the largest one, which is the angle between the tangents of the two sides at V i The next vertex is E i+1 The other end of the search continues until V0 is searched again, completing the minimum cycle search.

[0033] Preferably, if a zero matrix is ​​obtained through the minimum loop search, all panels can be obtained according to the panel loop algorithm; if a zero matrix is ​​not obtained through the minimum loop search, the minimum loop algorithm is repeated until all elements in M ​​are zero.

[0034] Preferably, if there is a panel with only two curves in the structural finite element model, the corresponding minimum cycle has only two edges in the relationship graph G, and there should be no more than two edges between two vertices, then before creating the adjacency matrix, all edges with other edges between the two ends should be found, a vertex is inserted in the middle of each edge, each edge is split into two edges, and then a new relationship graph is created, and then the adjacency matrix is ​​created based on the newly created relationship graph. After the minimum cycle search, the inserted vertices are deleted and the split edges are merged.

[0035] Preferably, the structural finite element model in S4 includes two parts, one is a mesh, which is composed of nodes and elements; the other is a property, which includes physical properties and material properties;

[0036] The mesh of the structural finite element model is created by meshing the panels in the structural finite element model, uniformly meshing on common edges of adjacent panels;

[0037] The properties of the structural finite element model are inherited from the structural model and will be automatically applied to the mesh. If the structural model is modified, the properties of the mesh and the structural finite element model will be automatically updated.

[0038] Therefore, the present invention adopts a large-scale surface JT target characteristic rapid modeling method according to the above content, which has the following beneficial effects compared with the prior art:

[0039] 1. Rapid updating of JT structural models is achieved through parametric modeling, automatic geometric constraint solving and panel generation algorithm, which is suitable for efficient construction of large-scale models. The parameter-driven modeling feature enables the model to quickly adapt to different JT design requirements. Through the optimization processing of the geometric constraint solving algorithm, it can quickly respond to the complex changes of different design schemes, reducing the time cost of scheme adjustment;

[0040] 2. The whole process from geometric model to finite element analysis model is systematically generated, which fully supports all stages of JT structure design, analysis and optimization. It achieves a comprehensive improvement in efficiency, accuracy and applicability in JT target modeling methods, which is of great significance to the design, performance analysis and subsequent optimization of large-scale complex water surface JT.

[0041] The technical solution of the present invention is further described in detail below through the accompanying drawings and embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Figure 1 It is a parameterized JT finite element analysis flow chart of a large-scale surface JT target characteristic rapid modeling method of the present invention;

[0043] Figure 2 This is a diagram of the geometric constraint solving process of a structural plate of a large-scale surface JT target characteristic rapid modeling method of the present invention;

[0044] Figure 3 A diagram of the creation process of a relationship diagram G of a large-scale surface JT target characteristic rapid modeling method of the present invention;

[0045] Figure 4 The present invention is a flowchart for searching all panels of a large surface JT target characteristic rapid modeling method. DETAILED DESCRIPTION

[0046] Example

[0047] In the description of the present invention, it should be noted that the terms "upper", "lower", "inside", "outside", etc. indicate directions or positional relationships based on the directions or positional relationships shown in the accompanying drawings, or are directions or positional relationships in which the product of the invention is usually placed when in use. They are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific direction, be constructed and operated in a specific direction, and therefore should not be understood as a limitation on the present invention.

[0048] like Figure 1-Figure 4As shown, a large-scale surface JT target characteristic rapid modeling method of the present invention comprises the following steps:

[0049] S1. Define the geometry, relationship, physical properties and material properties of the structure through parameterization based on the geometric characteristics and functional requirements of JT, i.e., ship structural plates and structural plate accessories;

[0050] Parameter-driven is an important feature of parameter design. In the JT structural model, parameter is a broad concept that contains more meanings than the traditional concept.

[0051] Hull surface: We consider the hull surface as a generalized parameter, and the modification or replacement of the hull surface will lead to the update of all structures connected to the hull surface;

[0052] Frame Space and Longitudinal Space: The positions of many structural components are defined using frame space or longitudinal space instead of actual coordinates. If the frame space or longitudinal space is modified, the system will change these components;

[0053] Main structural position: The main structural position, such as double bottom height, double hull width, platform height, etc., determines the position of the corresponding structure;

[0054] Parameters are the main factors of the structure, driving the structural model to change in a wide range. These constraints automatically maintain the relationship between structural members. Parameters and constraints make the structural model easy to create and modify. Through the two stages of parameterization mentioned above, namely plate parameterization and accessory parameterization, a constraint-satisfying structural model is created;

[0055] The parametric structural model is a structural model defined by constraints, parameters and necessary geometry. Constraints used to maintain structural relationships, once specified, will be automatically maintained and resolved by the system. Parameters are the main dimensions of JT, and they can drive the structural model together with constraints. When defining structural components, only necessary geometric data need to be defined, while other data are generated by related parameters. If the related parameters are changed, they will be automatically updated. The JT structure is mainly composed of structural plates and structural plates with accessories, including structural plates with accessories such as reinforcement plates, brackets, openings, etc. The structural plate is the foundation of the structure. The specific process of its parametric modeling is as follows:

[0056] S11, parametric modeling of the structural plate in JT;

[0057] S12. Parametric modeling of the structural plate with attachments in JT and management of the shape or position of the attachments of the structural plate;

[0058] The attachments of the structural plate are provided with constraints, and the three constraints of the attachments are as follows:

[0059] Subordinate constraints: make attachments subordinate to the structural plate, ensuring that attachments are moved, copied, and deleted together with the structural plate to which they belong;

[0060] Boundary constraint: The attachment is bounded by the structural plate and is extended or trimmed according to the structural plate;

[0061] Distance constraint: The distance between the attachment and the structural plate boundary satisfies a certain equation;

[0062] S2. Develop a three-dimensional constraint solving algorithm based on the geometric relationship of the JT structure in S1. The geometric shape of the structural plate in the structural model is very simple, but the number of structural plates is large. Therefore, it is impossible to solve the geometric constraint solving system using the traditional geometric constraint solving algorithm. According to the characteristics of the JT structural model, a three-dimensional geometric constraint solver is developed under the premise of avoiding closed constraints in the modeling stage. Since the base surface and the boundary are relatively independent, the geometric constraint solving system of the structural plate is divided into two subsystems: the base surface and the boundary. Figure 2 The constraint solving process is given. The most important and difficult step is to find the construction order of the base plane and the construction order of the boundary. The algorithm of the three-dimensional solver is as follows:

[0063] S21, PL = {(p1, b1),…, (p n ,b n )}, PL is the plate set of all structural plates in the structural model, where n is the number of plates, p i is the base surface of the structural plate, b i is the boundary of the structural plate, i = 1, 2, ..., n;

[0064] S22, find the base plane construction sequence Q = {q1, q2, ..., q n}, where q i ∈PL,q j The base surface is not q i , j = 1, 2, ..., n;

[0065] S23. Calculate the geometry of the base plane of all structural plates, where there are no closed constraints, q i The base plane does not depend on any other plane. If all {q1,…,q i-1}, then q i It can be done by {q1,…,q i-1}Calculate;

[0066] S24, find the boundary construction sequence S = {s1, s2, ..., s n}, where s i ∈PL,s j The base surface is not s i The predecessor entity of , j∈(i,n);

[0067] S25, calculating the bounded plane of each structural plate by simultaneously solving the base surface and the boundary of each structural plate, the bottom surface being calculated as described in S23,

[0068] S26. The undetermined part of the structural plate is the boundary. Since there is no closed constraint in the boundary, s i The boundaries of the plate do not depend on any other structural plate;

[0069] S3, based on the constraint satisfaction model in S2, the structural plate is divided into panels, and a panel relationship diagram is established to generate a panel structure model;

[0070] S31, obtaining a plate set intersecting with a target structural plate and the intersection points of the target structural plate and each structural plate in the intersecting plate set and saving the intersection points in a curve set;

[0071] S32, in the intersection curve set, mutually obtain all intersection points of the curves, and save them in the intersection set;

[0072] S33, segmenting all the curves in the intersection curve set with the intersection points in the intersection point set, and creating a new curve segment set;

[0073] S34, using the points in the intersection set as vertices V and the curves in the intersection set as edges E, create an undirected connected graph G = (V, E), where G is a relationship graph;

[0074] S35, searching for the minimum cycle of G based on the panel search algorithm to solve the problem of creating a panel structure model; the specific process of the panel search algorithm is as follows:

[0075] S351. Create adjacency matrix M n×n , where n is the number of vertices, M i,j , i∈(1,n),j∈(1,n) not only indicates whether there is an edge between vertices i and j, but also indicates the number of times the corresponding edge needs to be searched. For each element in M, it corresponds to an edge in G. Assuming that there is no more than one edge between any two vertices, if there is an edge between nodes i and j, then M is first searched. i,j Set to 2, otherwise set to 0;

[0076] S352, perform a maximum loop search, starting from V0, where the X coordinate and Y coordinate are the largest among all vertices, E0 is the first edge to be searched, this edge is associated with the smallest angle between V0 and the X coordinate, if an edge is searched, the corresponding element in M ​​should be reduced by 1, let V i is the current vertex, E i is the current edge, E s For V iThe set of related active edges. An active edge is an edge that has been searched less than twice. The corresponding element of an active edge in M ​​is 1 or 2. The next edge E i+1 YesE s Zhong and E i The direction angle is the smallest one, which is the angle between the tangents of the two sides at V i The next vertex is E i+1 The other end of the search continues until V0 is searched again, completing the maximum cycle search;

[0077] S353, perform a minimum loop search, starting from V0, where the X and Y coordinates are the largest among all vertices, E0 is the first edge to be searched, this edge is associated with the smallest angle between V0 and the X coordinate, if an edge is searched, the corresponding element in M ​​should be reduced by 1, let V i is the current vertex, E i is the current edge, E s For V i The set of related active edges. An active edge is an edge that has been searched less than twice. The corresponding element of an active edge in M ​​is 1 or 2. The next edge E i+1 YesE s Zhong and E i The direction angle is the largest one, which is the angle between the tangents of the two sides at V i The next vertex is E i+1 Until V0 is searched again, the minimum cycle search is completed

[0078] If a zero matrix is ​​obtained through the minimum loop search, all panels can be obtained according to the panel loop algorithm; if a zero matrix is ​​not obtained through the minimum loop search, the minimum loop algorithm is repeated until all elements in M ​​are zero;

[0079] If there are panels with only two curves in the structural finite element model, the corresponding minimum cycle has only two edges in the relationship graph G, and there should be no more than two edges between two vertices. Before creating the adjacency matrix, all edges with other edges between the two ends should be found, a vertex should be inserted in the middle of each edge, each edge should be split into two edges, and then a new relationship graph should be created. Then, the adjacency matrix should be created based on the newly created relationship graph. After the minimum cycle search, the inserted vertices should be deleted and the split edges should be merged;

[0080] S4, meshing the panel of S3 and inheriting the properties of the structural model, so that a structural finite element model is automatically generated, wherein the structural finite element model includes two parts, one is a mesh, which is composed of nodes and elements; the other is a property, which includes physical properties and material properties;

[0081] The mesh of the structural finite element model was created by meshing the panels in the structural finite element model uniformly on the common edges of adjacent panels;

[0082] The properties of the structural finite element model are inherited from the structural model and will be automatically applied to the mesh. If the structural model is modified, the properties of both the mesh and the structural finite element model will be automatically updated.

[0083] During the specific implementation process:

[0084] First, create a structural model. The structural model consists of four parts: the geometry of the structure, the relationship between the structures, the physical properties (such as the cross section of the beam or the thickness of the plate), and the material properties. When the structural model is created and all parameters are correctly specified, the rest of the work will be done automatically by the program.

[0085] Secondly, the constraint satisfaction structural model is obtained by solving the geometric constraint system, and the panel structural model is created by dividing the plate in the constraint satisfaction structural model into panels;

[0086] Finally, the structural finite element model is generated by meshing all panels of the structural model that satisfy the constraints and setting the mesh properties inherited from the structural model. If the structure needs to be modified according to the finite element analysis results, only the parameters of the structural model need to be modified. The structural model is driven by the parameters, and the structural finite element model will automatically change according to the structural model.

[0087] Therefore, the present invention adopts a large surface JT target characteristic rapid modeling method as described above, and through parametric modeling, constraint solving and finite element analysis technology, quickly generates a target model that meets the structural characteristic requirements to improve the efficiency of combat simulation and design optimization.

[0088] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that they can still modify or replace the technical solution of the present invention with equivalents, and these modifications or equivalent replacements cannot cause the modified technical solution to deviate from the spirit and scope of the technical solution of the present invention.

Claims

1. A method for rapid modeling of large surface JT target characteristics, characterized by: S1. Define the geometry, relationships, physical properties and material properties of the structure through parameterization based on the geometric characteristics and functional requirements of the JT structural plate and structural plate accessories; S2, develop a three-dimensional constraint solving algorithm based on the geometric relationship of the JT structure in S1; S3, based on the constraint satisfaction model in S2, the structural plate is divided into panels, and a panel relationship diagram is established to generate a panel structure model; S4. Mesh the panel of S3 and inherit the properties of the structural model so that the structural finite element model is automatically generated.

2. A large surface JT target characteristic rapid modeling method according to claim 1, characterized in that: The JT structure in S1 is mainly composed of structural plates and structural plates with accessories. The specific process of parametric modeling is as follows: S11, parametric modeling of the structural plate in JT; S12. Parametrically model the structural plate with attachments in JT and manage the shape or position of the attachments of the structural plate.

3. A large surface JT target characteristic rapid modeling method according to claim 2, characterized in that: The algorithm of the three-dimensional solver in S2 is as follows: S21, PL = {(p1, b1),…, (p n ,b n )}, PL is the plate set of all structural plates in the structural model, where n is the number of plates, p i is the base surface of the structural plate, b i is the boundary of the structural plate, i = 1, 2, ..., n; S22, find the base plane construction sequence Q = {q1, q2, ..., q n }, where q i ∈PL,q j The base surface is not q i , j = 1, 2, ..., n; S23. Calculate the geometry of the base plane of all structural plates, where there are no closed constraints, q i The base plane does not depend on any other plane. If all {q1,…,q i-1 }, then q i It can be done by {q1,…,q i-1 }Calculate; S24, find the boundary construction sequence S = {s1, s2, ..., s n }, where s i ∈PL,s j The base surface is not s i The predecessor entity of , j∈(i,n); S25, calculating the bounded plane of each structural plate by simultaneously solving the base surface and the boundary of each structural plate, and the bottom surface is calculated as described in S23; S26. The undetermined part of the structural plate is the boundary. Since there is no closed constraint in the boundary, s i The boundaries of the plate do not depend on any other structural plate.

4. A large surface JT target characteristic rapid modeling method according to claim 3, characterized in that: The attachments of the structural plate are provided with constraints, and the three constraints of the attachments are as follows: Subordinate constraints: make attachments subordinate to the structural plate, ensuring that attachments are moved, copied, and deleted together with the structural plate to which they belong; Boundary constraint: The attachment is bounded by the structural plate and is extended or trimmed according to the structural plate; Distance constraint: The distance between the attachment and the structural plate boundary satisfies a certain equation.

5. A large surface JT target characteristic rapid modeling method according to claim 4, characterized in that: S31, obtaining a plate set intersecting with a target structural plate and the intersection points of the target structural plate and each structural plate in the intersecting plate set and saving the intersection points in a curve set; S32, in the intersection curve set, mutually obtain all intersection points of the curves, and save them in the intersection set; S33, segmenting all the curves in the intersection curve set with the intersection points in the intersection point set, and creating a new curve segment set; S34, using the points in the intersection set as vertices V and the curves in the intersection set as edges E, create an undirected connected graph G = (V, E), where G is a relationship graph; S35. Based on the panel search algorithm, the minimum cycle of G is searched to solve the problem of creating a panel structure model.

6. A large surface JT target characteristic rapid modeling method according to claim 5, characterized in that: The panel search algorithm process in S35 is as follows: S351. Create adjacency matrix M n×n , where n is the number of vertices, M i,j , i∈(1,n),j∈(1,n) not only indicates whether there is an edge between vertices i and j, but also indicates the number of times the corresponding edge needs to be searched. For each element in M, it corresponds to an edge in G. Assuming that there is no more than one edge between any two vertices, if there is an edge between nodes i and j, then M is first searched. i,j Set to 2, otherwise set to 0; S352, perform a maximum loop search, starting from V0, where the X coordinate and Y coordinate are the largest among all vertices, E0 is the first edge to be searched, this edge is associated with the smallest angle between V0 and the X coordinate, if an edge is searched, the corresponding element in M ​​should be reduced by 1, let V i is the current vertex, E i is the current edge, E s For V i The set of related active edges. An active edge is an edge that has been searched less than twice. The corresponding element of an active edge in M ​​is 1 or 2. The next edge E i+1 YesE s Zhong and E i The direction angle is the smallest one, which is the angle between the tangents of the two sides at V i The next vertex is E i+1 The other end of the search is continued until the maximum cycle search is completed; S353, perform a minimum loop search, starting from V0, where the X and Y coordinates are the largest among all vertices, E0 is the first edge to be searched, this edge is associated with the smallest angle between V0 and the X coordinate, if an edge is searched, the corresponding element in M ​​should be reduced by 1, let V i is the current vertex, E i is the current edge, E s For V i The set of related active edges. An active edge is an edge that has been searched less than twice. The corresponding element of an active edge in M ​​is 1 or 2. The next edge E i+1 YesE s Zhong and E i The direction angle is the largest one, which is the angle between the tangents of the two sides at V i The next vertex is E i+1 The other end of the search continues until V0 is searched again, completing the minimum cycle search.

7. A large surface JT target characteristic rapid modeling method according to claim 6, characterized in that: If a zero matrix is ​​obtained through the minimum loop search, all panels can be obtained according to the panel loop algorithm; if a zero matrix is ​​not obtained through the minimum loop search, the minimum loop algorithm is repeated until all elements in M ​​are zero.

8. A large surface JT target characteristic rapid modeling method according to claim 7, characterized in that: If there is a panel with only two curves in the structural finite element model, the corresponding minimum cycle has only two edges in the relationship graph G, and there should be no more than two edges between two vertices. Then before creating the adjacency matrix, all edges with other edges between the two ends should be found, a vertex is inserted in the middle of each edge, each edge is split into two edges, and then a new relationship graph is created, and then the adjacency matrix is ​​created based on the newly created relationship graph. After the minimum cycle search, the inserted vertices are deleted and the split edges are merged.

9. A large surface JT target characteristic rapid modeling method according to claim 8, characterized in that: The structural finite element model described in S4 includes two parts, one is the mesh, which is composed of nodes and elements; the other is the properties, which include physical properties and material properties; The mesh of the structural finite element model is created by meshing the panels in the structural finite element model, with uniform meshing on common edges of adjacent panels; The properties of the structural finite element model are inherited from the structural model and will be automatically applied to the mesh. If the structural model is modified, the properties of the mesh and the structural finite element model will be automatically updated.

Images