A rapid modeling method for JT target characteristics of large water surfaces

Abstract

This invention discloses a rapid modeling method for the characteristics of large-scale surface JT targets, relating to the technical field of surface JT modeling and target characteristic analysis. The method comprises the following steps: S1, defining the geometric shape, 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 its attachments; S2, developing a three-dimensional constraint solving algorithm based on the geometric relationships of the JT structure in S1; S3, dividing the structural plate into panels based on the constraint-satisfied model in S2, establishing a panel relationship diagram to generate a panel structure model; S4, meshing the panels from S3 and inheriting the properties of the structural model to automatically generate the structural finite element model. This invention employs the aforementioned rapid modeling method for the characteristics of large-scale surface JT targets to quickly generate target models that meet structural characteristic requirements, thereby improving the efficiency of combat simulation and design optimization.

Description

Technical Field

[0001] This invention relates to the field of JT modeling and target characteristic analysis technology for water surfaces, and in particular to a rapid modeling method for the JT target characteristics of large water surfaces. Background Technology

[0002] Large surface combatants (JTs), as important equipment in naval warfare, have complex structures and diverse functions. The purpose of JT target characteristic modeling is to assess their combat capabilities, optimize structural design, and support related applications. However, traditional methods are inefficient due to the need for complex geometric modeling and manual attribute definition, and are not conducive to rapid model adjustment to adapt to dynamic requirements.

[0003] Existing finite element modeling methods are mainly geared towards general structures, making it difficult to simultaneously address the parametric design and geometric property requirements of JT models. Furthermore, modeling large JT targets often involves solving complex geometric constraints, for which effective solutions are lacking. Therefore, there is an urgent need for a rapid modeling method for large water surface JTs, enabling automatic correlation and efficient updating of geometric and physical property data. Summary of the Invention

[0004] The purpose of this invention is to provide a rapid modeling method for the characteristics of large surface JT targets. By using parametric modeling, constraint solving and finite element analysis techniques, a target model that meets the structural characteristic requirements can be quickly generated, thereby improving the efficiency of combat simulation and design optimization.

[0005] To achieve the above objectives, this invention provides a rapid modeling method for JT target characteristics of large water surfaces, comprising the following steps:

[0006] S1. Based on the geometric characteristics and functional requirements of JT structural panels and structural panel accessories, the geometry, relationships, physical properties and material properties of the structure are defined parametrically.

[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 of 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 in S3 and inherit the properties of the structural model to automatically generate the structural finite element model.

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

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

[0012] S12. Perform parametric modeling of the structural plates with attachments in JT and manage the shape or position of the attachments on the structural plates.

[0013] Preferably, the algorithm for the 3D solver in S2 is as follows:

[0014] S21, PL = {(p1,b1),…,(p n ,b n )}, PL is the set of all structural plates in the structural model, where n is the number of plates, p i b is the base surface of the structural slab. i Let i be 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 basal plane is not q i The preceding entity, j = 1, 2, ..., n;

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

[0017] S24. Find the boundary and construct the sequence S = {s1, s2, ..., s} n}, where s i ∈PL,s j The base plane is not s i The preceding entity, j∈(i,n);

[0018] S25. Calculate the bounded plane of each structural plate by simultaneously solving the base plane and boundary of each structural plate. The bottom plane is calculated as described in S23.

[0019] S26. The undetermined portion of the structural plate is the boundary. Since there are no closed constraints within the boundary, s i Its boundaries do not depend on any other structural plates.

[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 conform to the structural plate, ensuring that attachments are moved, copied, and deleted together with the structural plate to which they belong;

[0022] Boundary constraints: The attachments are bounded by the structural plate and are extended or modified according to the structural plate.

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

[0024] Preferably, in step S31, the set of plates intersecting with the target structural plate and the intersection points between the target structural plate and each structural plate in the set of intersecting plates are obtained and the intersection points are saved in the curve set.

[0025] S32. In the set of intersection curves, obtain all the intersection points of the curves and store them in the set of intersection points;

[0026] S33. Divide all curves in the intersection point set into their intersection points and create a new set of curve segments.

[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 relational graph;

[0028] S35. Solve the problem of creating a panel structure model by searching for the minimum cycle of G based on the panel search algorithm.

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

[0030] S351. Create the adjacency matrix M n×n Where n is the number of vertices, M i,j Let i∈(1,n), j∈(1,n) represent not only whether there is an edge between vertices i and j, but also the number of searches required to find that edge. Each element in M ​​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 first search M... i,j Set to 2, otherwise set to 0;

[0031] S352. Perform a maximum 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, associated with the angle where V0 has the smallest X coordinate. If an edge is searched, the corresponding element in M ​​should be decreased by 1. Let V... i For the current vertex, E i For the current edge, E s To be with V i The set of related active edges, where an active edge is an edge that has been searched less than twice. The active edge in M ​​corresponds to an element of 1 or 2, and the next edge is E. i+1 It is E s China and E i The smallest orientation angle; the orientation angle is the angle between the tangents of the two sides at V. iAt the angle of E, the next vertex is E. i+1 At the other end, the maximum loop search is completed until V0 is searched again;

[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, associated with the angle where V0 has the smallest X coordinate. If an edge is searched, the corresponding element in M ​​should be decreased by 1. Let V... i For the current vertex, E i For the current edge, E s To be with V i The set of related active edges, where an active edge is an edge that has been searched less than twice. The active edge in M ​​corresponds to an element of 1 or 2, and the next edge is E. i+1 It is E s China and E i The largest direction angle is the one where the tangents of the two sides meet at V. i At the angle of E, the next vertex is E. i+1 On the other end, the minimum cycle search is completed until V0 is searched again.

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

[0034] Preferably, if the finite element model of the structure contains a panel with only two curves, and the corresponding minimum cycle has only two edges in the relation graph G, and there should not be 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 should be inserted in the middle of each edge to divide each edge into two edges, and then a new relation graph should be created. Then, the adjacency matrix should be created based on the newly created relation graph. After the minimum cycle search, the inserted vertex should be deleted, and the divided edges should be merged.

[0035] Preferably, the structural finite element model described in S4 includes two parts: a mesh, which consists of nodes and elements; and properties, which include physical properties and material properties.

[0036] The mesh of the structural finite element model is created by panel meshing in the structural finite element model, with a uniform mesh on the common edge 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 both the mesh and the structural finite element model will be automatically updated.

[0038] Therefore, the present invention provides a rapid modeling method for the JT target characteristics of large water surfaces, which, compared with the prior art, has the following advantages:

[0039] 1. By using parametric modeling, automatic geometric constraint solving, and panel generation algorithms, the JT structural model can be updated quickly, making it suitable for the efficient construction of large-scale models. The parameter-driven modeling characteristics enable the model to quickly adapt to different JT design requirements. Through the optimization 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 system generates the entire process from geometric model to finite element analysis model, fully supporting all stages of JT structure design, analysis and optimization. It achieves a comprehensive improvement in efficiency, accuracy and applicability of JT target modeling method, which is of great significance for the design, performance analysis and subsequent optimization of large-scale complex water surface JT.

[0041] The technical solution of the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. Attached Figure Description

[0042] Figure 1 This is a parameterized JT finite element analysis flowchart of a rapid modeling method for JT target characteristics of large water surfaces according to the present invention.

[0043] Figure 2 This is a diagram illustrating the geometric constraint solution process of a structural plate for a rapid modeling method of JT target characteristics for large water surfaces, as described in this invention.

[0044] Figure 3 This is a diagram illustrating the creation process of the relational graph G in the rapid modeling method for JT target characteristics of a large water surface according to the present invention.

[0045] Figure 4 This is a flowchart illustrating the process of searching all panels in a rapid modeling method for JT target characteristics of a large water surface according to the present invention. Detailed Implementation

[0046] Example

[0047] In the description of this invention, it should be noted that the terms "upper," "lower," "inner," "outer," etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings, or the orientation or positional relationship in which the product of this invention is usually placed when in use. They are only for the convenience of describing this invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation. Therefore, they should not be construed as limiting this invention.

[0048] like Figures 1-4As shown, the present invention provides a method for rapid modeling of JT target characteristics of large water surfaces, comprising the following steps:

[0049] S1. Based on the geometric characteristics and functional requirements of JT (i.e., ship structural plates and structural plate accessories), the geometry, relationships, physical properties, and material properties of the structure are defined parametrically.

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

[0051] Hull surface: We treat the hull surface as a generalized parameter. Modification or replacement of the hull surface will result in updating 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] Key structural locations: Key structural locations, such as double bottom height, double shell width, and platform height, determine the location of the corresponding structures;

[0054] Parameters are the main factors of the structure, driving the structural model to vary over a wide range. These constraints automatically maintain the relationships 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 attachment parameterization, a constraint-satisfied structural model is created.

[0055] A parametric structural model is a structural model defined by constraints, parameters, and necessary geometry. It maintains structural relationships through constraints, which the system automatically maintains and resolves once specified. Parameters are the main dimensions of the JT (Junior Structure), driving the structural model along with constraints. When defining structural members, only necessary geometric data needs to be defined, while other data is generated by the relevant parameters. If the relevant parameters are changed, they will be automatically updated. The JT structure mainly consists of structural plates and structural plates with attachments, including plates with reinforcing plates, supports, openings, etc. The structural plates are the foundation of the structure. The specific process of parametric modeling is as follows:

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

[0057] S12. Parametrically model the structural plates with attachments in JT and manage the shape or position of the attachments on the structural plates.

[0058] The structural plate's attachments are subject to constraints. The three types of constraints for the attachments are as follows:

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

[0060] Boundary constraints: The attachments are bounded by the structural plate and are extended or modified according to the structural plate.

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

[0062] S2. Based on the geometric relationships of the JT structure in S1, a three-dimensional constraint solving algorithm was developed. The geometric shapes of the structural plates in the structural model are simple, but the number of plates is large. Therefore, it is impossible to solve the geometric constraint system using traditional geometric constraint solving algorithms. Based on the characteristics of the JT structural model, and while avoiding closed constraints during the modeling stage, a three-dimensional geometric constraint solver was developed. Since the base planes and boundaries are relatively independent, the geometric constraint solving system of the structural plates is divided into two subsystems: base planes and boundaries. Figure 2 The constraint solution process is presented. The most important and difficult step is finding the construction order of the base planes and the boundary; the algorithm of the 3D solver is as follows:

[0063] S21, PL = {(p1,b1),…,(p n ,b n )}, PL is the set of all structural plates in the structural model, where n is the number of plates, p i b is the base surface of the structural slab. i Let i be 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 basal plane is not q i The preceding entity, j = 1, 2, ..., n;

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

[0066] S24. Find the boundary and construct the sequence S = {s1, s2, ..., s} n}, where s i ∈PL,s j The base plane is not s i The preceding entity, j∈(i,n);

[0067] S25. Calculate the bounded plane of each structural plate by simultaneously solving for the base plane and boundary plane of each structural plate. The bottom plane is calculated as described in S23.

[0068] S26. The undetermined portion of the structural plate is the boundary. Since there are no closed constraints within the boundary, s i The boundary does not depend on any other structural plate;

[0069] S3. Based on the constraint-satisfaction model of S2, the structural plate is divided into panels, and a panel relationship diagram is established to generate a panel structure model.

[0070] S31. Obtain the set of plates that intersect with the target structural plate and the intersection points between the target structural plate and each structural plate in the intersecting plate set, and save the intersection points in the curve set.

[0071] S32. In the set of intersection curves, obtain all the intersection points of the curves and store them in the set of intersection points;

[0072] S33. Divide all curves in the intersection point set into their intersection points and create a new set of curve segments.

[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 relational graph;

[0074] S35. The problem of creating a panel structure model is solved by searching for the minimum cycle of G using a panel search algorithm; the specific process of the panel search algorithm is as follows:

[0075] S351. Create the adjacency matrix M n×n Where n is the number of vertices, M i,j Let i∈(1,n), j∈(1,n) represent not only whether there is an edge between vertices i and j, but also the number of searches required to find that edge. Each element in M ​​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 first search M... i,j Set to 2, otherwise set to 0;

[0076] S352. Perform a maximum 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, associated with the angle where V0 has the smallest X coordinate. If an edge is searched, the corresponding element in M ​​should be decreased by 1. Let V... i For the current vertex, E i For the current edge, E s To be with V iThe set of related active edges, where an active edge is an edge that has been searched less than twice. The active edge in M ​​corresponds to an element of 1 or 2, and the next edge is E. i+1 It is E s China and E i The smallest orientation angle; the orientation angle is the angle between the tangents of the two sides at V. i At the angle of E, the next vertex is E. i+1 At the other end, the maximum loop search is completed until V0 is searched again;

[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, associated with the angle where V0 has the smallest X coordinate. If an edge is searched, the corresponding element in M ​​should be decreased by 1. Let V... i For the current vertex, E i For the current edge, E s To be with V i The set of related active edges, where an active edge is an edge that has been searched less than twice. The active edge in M ​​corresponds to an element of 1 or 2, and the next edge is E. i+1 It is E s China and E i The largest direction angle is the one where the tangents of the two sides meet at V. i At the angle of E, the next vertex is E. i+1 At the other end, the minimum cycle search is completed until V0 is searched again.

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

[0079] If a panel in the structural finite element model has only two curves, and the corresponding minimum cycle has only two edges in the relation graph G, and there should not be 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 should be inserted in the middle of each edge to split each edge into two edges, and then a new relation graph should be created. Then, the adjacency matrix should be created based on the newly created relation graph. After the minimum cycle search, the inserted vertex should be deleted and the split edges should be merged.

[0080] S4. Mesh the panel in S3 and inherit the properties of the structural model to automatically generate the structural finite element model. The structural finite element model consists of two parts: a mesh, which is composed of nodes and elements; and properties, which include physical properties and material properties.

[0081] The mesh of the structural finite element model is created by the panel mesh in the structural finite element model, with a uniform mesh on the common edge 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] In the specific implementation process:

[0084] First, create a structural model, which consists of four parts: the geometry of the structure, the relationships between the structures, physical properties (such as the cross-section of a beam or the thickness of a plate), and material properties. Once 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, by solving the geometric constraint system, a constraint-satisfied structural model was obtained. By dividing the plate in the constraint-satisfied structural model into panels, a panel structure model was created.

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

[0087] Therefore, this invention adopts a rapid modeling method for the characteristics of large surface JT targets, which uses parametric modeling, constraint solving and finite element analysis techniques to quickly generate target models that meet structural characteristic requirements, thereby improving 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 solutions of the present invention and not to limit them. Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can still be made to the technical solutions of the present invention, and these modifications or equivalent substitutions cannot cause the modified technical solutions to deviate from the spirit and scope of the technical solutions of the present invention.

Claims

1. A method for rapid modeling of JT target characteristics on large water surfaces, characterized in that: S1. Based on the geometric characteristics and functional requirements of JT structural panels and structural panel accessories, the geometry, relationships, physical properties and material properties of the structure are defined parametrically. The structural plate's attachments are subject to constraints. The three types of constraints for the attachments are as follows: Subordinate constraints: Make attachments conform to the structural plate, ensuring that attachments are moved, copied, and deleted together with the structural plate to which they belong; Boundary constraints: The attachments are based on the structural plate as the boundary, and are extended or modified according to the structural plate. Distance constraint: The distance between the attachment and the boundary of the structural plate satisfies a certain equation; S2. Develop a three-dimensional constraint solution algorithm based on the geometric relationships of the JT structure in S1; the algorithm of the three-dimensional solver is as follows: S21, , PL It is the set of all structural plates in the structural model, where n For the number of boards, For the base surface of the structural panel, For the boundary of the structural panel, ; S22, Find the base plane construction sequence ,in , The base is not The preceding entity, ; S23. Calculate the geometry of the base plane of all structural plates, assuming there are no closed constraints on the base plane. The base plane does not depend on any other plane, if all of them are calculated. ,but It can be passed Calculated; S24. Find the boundary and construct the sequence. ,in , The base is not The preceding entity, ; S25. Calculate the bounded plane of each structural plate by simultaneously solving the base plane and boundary of each structural plate. The bottom plane is calculated as described in S23. S26. The undefined portion of the structural slab is the boundary. Since there are no closed constraints within the boundary, The boundary does not depend on any other structural plate; S3. Based on the constraint-satisfaction model of 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 in S3 and inherit the properties of the structural model to automatically generate the structural finite element model.

2. The method for rapid modeling of JT target characteristics of large water surfaces according to claim 1, characterized in that: The JT structure in S1 mainly consists of structural plates and structural plates with attachments. The specific process of its parametric modeling is as follows: S11. Perform parametric modeling of the structural plate in JT; S12. Perform parametric modeling of the structural plates with attachments in JT and manage the shape or position of the attachments on the structural plates.

3. The method for rapid modeling of JT target characteristics of large water surfaces according to claim 2, characterized in that: S31. Obtain the set of plates that intersect with the target structural plate and the intersection points between the target structural plate and each structural plate in the intersecting plate set, and save the intersection points in the curve set. S32. In the set of intersection curves, obtain all the intersection points of the curves and store them in the set of intersection points; S33. Divide all curves in the intersection point set into their intersection points and create a new set of curve segments. S34. Use the points in the intersection set as vertices. V Using the curves in the set of intersection points as edges E Create an undirected connected graph. G = ( V , E ),in G For the relationship diagram; S35, Panel Search Algorithm Search G The problem of creating a panel structure model can be solved using a minimum loop.

4. The method for rapid modeling of JT target characteristics of large water surfaces according to claim 3, characterized in that: The panel search algorithm process in S35 is as follows: S351. Create an adjacency matrix ,in It is the number of vertices. Not only representing vertices and Whether there is an edge between them also indicates the number of times the corresponding edge needs to be searched. M Each element in corresponds to G An edge in a given set, assuming there is no more than one edge between any two vertices, if node and If there is an edge between them, then first... Set to 2, otherwise set to 0; S352, Perform a maximum cycle search, starting from... V 0 Start searching, among them X coordinates and Y The coordinates are the largest among all vertices. E 0 The first edge to search, this edge is... V 0 and X The angle with the smallest coordinates is associated; if an edge is searched, then... M The corresponding element should be reduced by 1. Let... For the current vertex, For the current edge, E s To and The set of related active edges, where active edges are edges that require fewer than two searches. M The corresponding element in the middle is 1 or 2, the next edge yes E s Zhongyu The smallest direction angle; the direction angle is the angle between the tangents of the two sides. At the angle of [location], the next vertex is [location]. At the other end, the maximum loop search is completed until the next search; S353, Perform a minimum loop search, starting from... V 0 Start searching, among them X coordinates and Y The coordinates are the largest among all vertices. E 0 The first edge to search, this edge is... V 0 It is related to the angle with the smallest X coordinate; if an edge is searched, then... M The corresponding element should be reduced by 1. Let... For the current vertex, For the current edge, E s To and The set of related active edges, where active edges are edges that require fewer than two searches. M The corresponding element in the middle is 1 or 2, the next edge yes E s Zhongyu The largest direction angle; the direction angle is the angle between the tangents of the two sides. At the angle of [location], the next vertex is [location]. On the other end, until the search continues V 0 At that time, the minimum cycle search is completed.

5. The method for rapid modeling of JT target characteristics of large water surfaces according to claim 4, characterized in that: If a zero matrix is ​​obtained through the minimum loop search, then all panels can be obtained according to the panel loop algorithm; if a zero matrix is ​​not obtained through the minimum loop search, then the minimum loop algorithm is repeated until all elements in M ​​are zero.

6. The method for rapid modeling of JT target characteristics of large water surfaces according to claim 5, characterized in that: If the finite element model of the structure contains a panel with only two curves, and the corresponding minimum cycle in the relation graph G has only two edges, and there should not be 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 should be inserted in the middle of each edge to divide each edge into two edges, and then a new relation graph should be created. Then, the adjacency matrix should be created based on the newly created relation graph. After the minimum cycle search, the inserted vertex should be deleted, and the divided edges should be merged.

7. The method for rapid modeling of JT target characteristics of large water surfaces according to claim 6, characterized in that: The structural finite element model described in S4 consists of two parts: a mesh, which is composed of nodes and elements; and properties, which include physical properties and material properties. The mesh of the structural finite element model is created by panel meshing in the structural finite element model, with a uniform mesh on the common edge 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 both the mesh and the structural finite element model will be automatically updated.

Images