CN116934997A - Grid generation and structure simulation analysis method, device, equipment and storage medium - Google Patents
Grid generation and structure simulation analysis method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN116934997A CN116934997A CN202210318419.6A CN202210318419A CN116934997A CN 116934997 A CN116934997 A CN 116934997A CN 202210318419 A CN202210318419 A CN 202210318419A CN 116934997 A CN116934997 A CN 116934997A
- Authority
- CN
- China
- Prior art keywords
- polyhedral
- grid
- mesh
- values
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000004458 analytical method Methods 0.000 title claims abstract description 79
- 238000004088 simulation Methods 0.000 title claims abstract description 54
- 238000000034 method Methods 0.000 claims abstract description 82
- 238000011156 evaluation Methods 0.000 claims abstract description 32
- 238000012545 processing Methods 0.000 claims description 13
- 238000004590 computer program Methods 0.000 claims description 11
- 230000008676 import Effects 0.000 claims description 6
- 230000008569 process Effects 0.000 description 27
- 238000010586 diagram Methods 0.000 description 21
- 238000004364 calculation method Methods 0.000 description 10
- 230000007704 transition Effects 0.000 description 7
- 238000004422 calculation algorithm Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 229910000831 Steel Inorganic materials 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 239000010959 steel Substances 0.000 description 2
- 238000012916 structural analysis Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000012530 fluid Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 230000001172 regenerating effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
- G06T17/205—Re-meshing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
- G06F30/23—Design optimisation, verification or simulation using finite element methods [FEM] or finite difference methods [FDM]
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Geometry (AREA)
- General Physics & Mathematics (AREA)
- Computer Graphics (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application relates to the technical field of simulation, and discloses a grid generation method, a structure simulation analysis method, a device, equipment and a storage medium, so as to improve grid generation efficiency. The method comprises the following steps: acquiring a preliminary grid body of an evaluation part, wherein the preliminary grid body comprises a plurality of polyhedral grids; according to the sequence of the depth values of the polyhedral grids from large to small, corresponding depth values are sequentially given to each vertex and adjacent vertices of each polyhedral grid as tag values, and the assigned vertices are not repeatedly given with tag values; and dividing the polyhedral grids with target label values larger than a preset value, and endowing each vertex of the newly divided polyhedral grids with a label value reduced according to the target label value until the label values of all the divided polyhedral grids are smaller than the preset value.
Description
Technical Field
The present application relates to the field of simulation technologies, and in particular, to a grid generating method, a structure simulation analysis method, a device, equipment, and a storage medium.
Background
Simulation techniques for finite element methods (finite element method, FEM), in which meshing is a part of the first most important preprocessing work, perform subsequent simulation work based on the generated mesh. The inventor researches and discovers that the FEM method is an indispensable simulation analysis method and mainly is applied to analysis of 3D structural strength, heat, fluid and the like. In the current generation scheme of the grid body with the 3D structure, a large amount of manual work is used for dividing grids by means of software, and the efficiency is low.
Disclosure of Invention
Based on this, it is necessary to provide a grid generating method, a structure simulation analysis method, a device, a facility and a storage medium to solve the problem of low efficiency in the conventional grid generating method.
A grid generation method, comprising:
acquiring a preliminary grid body of an evaluation part, wherein the preliminary grid body comprises a plurality of polyhedral grids;
according to the sequence from big to small of the depth values of the polyhedral grids, corresponding depth values are sequentially given to each vertex and adjacent vertices of each polyhedral grid as tag values, and the given vertex is not repeatedly given with the tag values;
And carrying out polyhedral mesh division on polyhedral meshes with target label values larger than a preset value in the polyhedral meshes, and endowing each vertex of the newly divided polyhedral meshes with a new label value until the label values of all the divided polyhedral meshes are smaller than the preset value and the label values of the newly divided polyhedral meshes are smaller than the target label value. In one embodiment, the preliminary mesh body includes a plurality of hexahedral meshes.
In one embodiment, the step of performing polyhedral mesh division on the polyhedral mesh with the target tag value larger than a preset value includes:
determining the number of labels of the target label value in a polyhedral grid with the target label value larger than a preset value;
determining a polyhedral dividing mode according to the number of the labels, and performing polyhedral mesh division on the polyhedral mesh with the target label value larger than a preset value according to the polyhedral dividing mode.
In one embodiment, before the label value is given to each vertex and adjacent vertices of each polyhedral grid in sequence from the higher depth value to the lower depth value of the polyhedral grid, the method further includes:
And according to the analysis requirements of the polyhedral grids, assigning corresponding depth values for the polyhedral grids, wherein the analysis requirements of the polyhedral grids are different, and the depth values corresponding to the polyhedral grids are also different.
In one embodiment, the assigning a new label value to each vertex of the newly divided polyhedral grid until the label values of all the divided polyhedral grids are smaller than the preset value, and the method further includes:
and taking the grids when the label values of all the polyhedral grids are smaller than the preset value as final grid bodies, and generating a simulation import file through the final grid bodies.
In one embodiment, the polyhedral grids having the same depth value are assigned in parallel when assigning the tag value.
A structural simulation analysis method, comprising:
obtaining a final grid body generated by the grid generation method;
and performing simulation analysis on the evaluation part by utilizing the final grid body.
A mesh generation apparatus comprising:
the acquisition module is used for acquiring a preliminary grid body of the evaluation part, wherein the preliminary grid body comprises a plurality of polyhedral grids;
The processing module is used for sequentially giving corresponding depth values as tag values to each vertex and adjacent vertices of each polyhedral grid according to the sequence from big to small of the depth values of the polyhedral grid, and the assigned vertices are not repeatedly given the tag values; and carrying out polyhedral mesh division on polyhedral meshes with target label values larger than a preset value in the polyhedral meshes, and endowing each vertex of the newly divided polyhedral meshes with a new label value until the label values of all the divided polyhedral meshes are smaller than the preset value and the label values of the newly divided polyhedral meshes are smaller than the target label value.
A structural simulation analysis apparatus comprising:
the acquisition module acquires a final grid body generated by the grid generation method;
and the processing module is used for carrying out simulation analysis on the evaluation part by utilizing the final grid body.
A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the aforementioned grid generation method or the steps of the aforementioned structure simulation analysis method when executing the computer program.
A computer readable storage medium storing a computer program, characterized in that the computer program when executed by a processor implements the grid generation method as described above, or the steps of the structure simulation analysis method as described above.
According to the scheme, the label values of the polyhedral grid vertices are automatically given after the preliminary grid body is designed, the label values of the polyhedral grid vertices are continuously divided until all label values of all the polyhedral grid vertices are smaller than the preset value, so that the final grid body is obtained, the grid generation process is automatic in reciprocation, high-precision grids can be automatically calculated in reciprocation, manual operation by software is not needed, grid generation efficiency is greatly improved, the development period is shortened as a whole, and labor cost investment is reduced.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments of the present application will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a grid generating method according to an embodiment of the application;
FIG. 2 is a schematic diagram of a process for assigning depth values and label values to a polyhedral grid in accordance with one embodiment of the present application;
FIG. 3 is a schematic diagram of a label of a hexahedral mesh in accordance with an embodiment of the present application;
FIG. 4 is a schematic diagram of a division of a hexahedral mesh in accordance with an embodiment of the present application;
FIG. 5 is another schematic view of a hexahedral mesh according to an embodiment of the present application;
FIG. 6 is a schematic diagram of vertex notepad calculation for a hexahedral mesh according to an embodiment of the present application;
FIG. 7 is a schematic representation of the result of a final mesh body produced in an embodiment of the present application;
FIG. 8 is another resulting schematic of a final mesh body generated in an embodiment of the application;
FIG. 9 is a schematic diagram of still another result of the final mesh body generated in an embodiment of the present application;
FIG. 10 is a schematic representation of yet another result of the final mesh body generated in an embodiment of the present application;
FIG. 11 is a flow chart of a structure simulation analysis method according to an embodiment of the application;
FIG. 12 is a schematic diagram of a grid generating apparatus according to an embodiment of the present application;
FIG. 13 is a schematic diagram of a structure simulation analysis apparatus according to an embodiment of the present application;
FIG. 14 is a schematic diagram of a computer device according to an embodiment of the application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
The grid generating method and the structure simulation analysis method provided by the embodiment can be applied to grid division of structural analysis such as a cantilever beam analysis, a plate stress analysis, a clutch steel sheet rotation stress analysis and the like of a vehicle in a 3D-FEM grid division scene and other 3D (three-dimensional) application scenes with grid division requirements, for example, in a 3D-FEM simulation analysis application scene of a vehicle part, and are more particularly, but not limited to. The grid generating method and the structure simulation analysis method may be implemented or performed by a computer device including, but not limited to, various personal computers, notebook computers, or servers, and are not particularly limited.
In an embodiment, as shown in fig. 1, an embodiment of the present application provides a grid generating method, including the following steps:
s10: and obtaining a preliminary grid body of the evaluation part, wherein the preliminary grid body comprises a plurality of polyhedral grids.
The evaluation site is a site where a stress analysis such as a stress analysis is required to be performed later, and the evaluation site may be a structural analysis such as a cantilever beam analysis, a plate stress analysis, and a clutch steel rotation stress analysis of a vehicle, for example, without limitation. The preliminary grid body is a grid body obtained by primarily dividing the grid body of the evaluation part. In some embodiments, the preliminary mesh body is a mesh body obtained by first analyzing by importing simulation software and roughly dividing the preliminary mesh body, and the divided preliminary mesh body includes a plurality of polyhedral meshes, that is, the preliminary mesh body may be a mesh body divided by first analyzing by using software and includes a plurality of roughly divided polyhedral meshes.
The polyhedral mesh may be a hexahedral mesh, for example. Of course, other polyhedral grids are also possible, such as other polyhedral grids, and are not particularly limited.
S20: and according to the sequence of the depth values of the polyhedral grids from large to small, corresponding depth values are sequentially given to each vertex and adjacent vertices of each polyhedral grid as tag values, and the given vertex is not repeatedly given with the tag values.
In this embodiment, each polyhedral mesh in the preliminary mesh body is assigned a corresponding depth value (ELEMENT DEPTH), wherein the size of the depth value reflects the analysis requirement strength of the user (evaluation site designer or evaluation site analyzer) on the corresponding region in the evaluation site, and the larger the depth value, the deeper the analysis requirement of the user on the polyhedral mesh. By way of example, the depth value may be, for example, 0, 1, 2, 3, 4.
It will be appreciated that, for each polyhedral mesh, it has a corresponding vertex, and after assigning a corresponding depth value to each polyhedral mesh in the preliminary mesh, a LABEL value (NODES LABEL) is assigned to each vertex of the polyhedral mesh according to the depth value assigned to the polyhedral mesh, where each vertex of the polyhedral mesh corresponds to a node, that is, a corresponding node LABEL value is assigned to each node of the polyhedral mesh, that is, the NODES LABEL described above. Taking the above polyhedral grid as a hexahedral grid as an example, after assigning a corresponding depth value to each hexahedral grid in the preliminary grid, eight vertices and adjacent vertices of each hexahedral grid are assigned corresponding label values according to the assigned depth values.
In this embodiment, the tag value is given by: and according to the sequence of the depth values of the polyhedral grids from large to small, corresponding depth values are sequentially given to each vertex and adjacent vertices of each polyhedral grid as tag values, the assigned vertices are not repeatedly given with tag values, namely, according to the maximum value principle of the depth values, the tag values of each vertex and adjacent vertices of the polyhedral grid with the largest depth value are given firstly, and finally, the vertex with the smallest depth value and the tag value of the adjacent vertex without the tag value are given, and the assigned vertex is not given any more.
In some embodiments, label values may be sequentially assigned to each vertex and adjacent vertices of each polyhedral mesh according to a maximum principle of depth values, and finally, when there are repeatedly assigned vertices, the label values that overlap may be automatically eliminated, which is not particularly limited.
In order to facilitate the description of the foregoing depth value assigning process, the assigning process may be described with reference to fig. 2, taking the case where the depth values of the hexahedral mesh in the preliminary mesh body include 0, 1, and 2 as examples. As shown in fig. 2, fig. 2 includes 4 schematic diagrams of division processes, where a diagram corresponding to "first division" is a schematic plan view of a preliminary mesh body (i.e., a certain face of the preliminary mesh body), the preliminary mesh body includes a plurality of hexahedral meshes, and different hexahedral meshes are respectively assigned with depth values of 0, 1 and 2, including four hexahedral meshes with depth values of 0, three hexahedral meshes with depth values of 1, and two hexahedral meshes with depth values of 2; schematic diagrams corresponding to "MAX assignment", "transition assignment" and "MIN assignment" are processes of sequentially assigning vertices and adjacent vertex label values of a hexahedral mesh in order of depth values from large to small, in this example, depth value 2 is a MAX value, depth value 1 is a transition value, depth value 0 is a MIN value, and for the "MAX assignment" process, eight vertices and label values of adjacent vertices of the hexahedral mesh having depth values 2 are assigned first; for the "transition assigning" process, that is, a process of assigning a label value of a hexahedral mesh with a depth value of 1, for example, a label value of 1 may be assigned to a vertex to which any label value is not assigned and an adjacent vertex to which any label value is not assigned, or the overlapping label values may be eliminated after being sequentially assigned; for the "MIN assignment" process, that is, a process of assigning a label value of a hexahedral mesh with a depth value of 0, it is exemplified that a label value of 0 may be specifically assigned to a vertex to which any label value is not assigned and an adjacent vertex to which any label value is not assigned, or label values which are sequentially assigned and then overlap are eliminated.
It should be noted that, fig. 2 is only for convenience of understanding, and a polyhedral grid is taken as a hexahedral grid, each hexahedral grid is taken as a regular hexahedral grid, a vertex of one surface of the hexahedron is taken as an example, depth values are taken as examples of 0, 1 and 2, specific division cases are various, and the application is not limited to the following description. In addition, in the embodiment of the present application, the transition region of the evaluation portion: i.e. the depth value between the MAX depth value and the MIN depth value plane.
It can be seen that the depth value of each polyhedral grid in the preliminary grid body can be determined by the depth value, and the label value of each polyhedral grid can be automatically given.
S30: and carrying out polyhedral mesh division on polyhedral meshes with target label values larger than a preset value in the polyhedral meshes, and endowing each vertex of the newly divided polyhedral meshes with a new label value until the label values of all the divided polyhedral meshes are smaller than the preset value and the label values of the newly divided polyhedral meshes are smaller than the target label value.
After assigning label values to each vertex and adjacent vertex of each polyhedral mesh in turn according to the order of the depth values of the polyhedral meshes from large to small, the embodiment of the application selects polyhedral meshing types of the polyhedral mesh and the adjacent polyhedral mesh according to the label value condition of each polyhedral mesh. Specifically, performing polyhedral division on the polyhedral grids with target tag values (one or more) larger than a preset value, and endowing each vertex of the newly divided polyhedral grids with a tag value which is decremented in a decrementing mode according to the preset tag value until the tag values of all the divided polyhedral grids are smaller than the preset value. It should be noted that, because there are one or more target label values, the vertex label values of the newly divided polyhedral mesh are smaller than the target label values, so that it can be ensured that the label values of the new polyhedral mesh after each division show a decreasing trend, and the label values will hereinafter describe the division process by taking hexahedron as an example, which will not be described here.
That is, the label values of the vertices of the new polyhedral mesh obtained by each division are continuously reduced until all label values are smaller than a preset value, and the division is terminated. That is, in this embodiment, the polyhedral cells are continuously divided according to the label values given to the polyhedral cells until the label values of all the divided polyhedral cells are smaller than the preset value. Through the mode, the grid subdivision of the part with strong analysis requirements can be realized, and the subsequent simulation analysis is facilitated.
The preset value is not particularly limited as to the depth value of the polyhedral mesh which is initially provided. Illustratively, taking the above depth values of 0, 1 and 2 as examples, the preset value may be 0.
It can be seen that the above process of re-meshing the mesh according to the label value of the polyhedral mesh is a cyclic process, and if the disassembling step is started, the label value is decremented by 1, for example, including the following steps: selecting a polyhedral mesh and a neighboring polyhedral mesh subdivision (1 time) according to a LABEL value (LABEL 0) of each polyhedral mesh in the current stage; after division, the LABEL value (LABEL 1) =label 0-1 of the polyhedral mesh newly divided at the present stage; judging whether the LABEL value (LABEL 1) of each polyhedral grid is larger than 0 according to the value of the LABEL value (LABEL 1) of each polyhedral grid in the current stage, if not, stopping calculation, and if so, selecting to continue selecting the polyhedral grid and continuously dividing the adjacent polyhedral grid (2 times); after division, the LABEL value (LABEL 2) =node LABEL1-1 of the newly divided polyhedral mesh at the present stage, and whether the LABEL value (LABEL 2) of each polyhedral mesh at the present stage is larger than 0 is determined, if not, calculation is stopped, if yes, division of the polyhedral mesh and the adjacent polyhedral mesh is continued (3 times), and so on, until all LABEL values of all polyhedral meshes=0, calculation is stopped, division of the polyhedral mesh is completed, and in this example, the LABEL value is reduced by 1, but the invention is not limited thereto.
It can be seen that, in the embodiment of the application, the label values of the polyhedral grid vertices are automatically given after the preliminary grid body is designed, and the label values of the polyhedral grid vertices are continuously divided based on the label values of the polyhedral grid vertices until the label values of the polyhedral grid vertices are smaller than the preset values, so that the final grid body is obtained, the automatic reciprocation of the final grid body generating process can be realized, the high-precision grid body can be automatically calculated in a reciprocating manner, manual operation by software is not needed, the grid body generating efficiency is greatly improved, the development period is integrally shortened, and the labor cost investment is reduced.
It should be noted that, in the above example, the depth values 2, 1, and 0, where the plane with the depth value 1 is the transition region, the larger the depth value, the finer the grid division is. It can also be seen here that the larger the depth value, the more computationally demanding the grid body is, the more empirically MAX value=2 of the depth value is sufficient, and therefore 2, 1, 0 are the better partners.
In an embodiment, the polyhedral grid corresponding to the transition region has continuous depth values, and it can be understood that the larger the depth value is, the finer the grid is generally divided, and by continuously setting the depth values, the overlarge width/length ratio in one unit can be effectively avoided, the stress abrupt change condition is generated, and the accuracy of the subsequent simulation analysis effect is reduced.
In one embodiment, in step S10, that is, obtaining a preliminary mesh body of the evaluation site, the method includes the following steps:
s11: drawing the evaluation part in drawing software to obtain a structure diagram corresponding to the evaluation part;
s12: the structure map is adapted so that the structure map can be divided into a plurality of geometric figures of the polyhedral grid.
In this embodiment, for any evaluation site, the evaluation site may be mapped by a mapping software such as CAD, and a structure diagram corresponding to the evaluation site is obtained. It should be noted that, since coarse division is required subsequently, and in order to be able to be divided into a plurality of polyhedral grids after coarse division, for example, the structure diagram is adaptively modified so that the structure diagram can be divided into geometric figures of a plurality of hexahedral grids. Therefore, through the embodiment, the follow-up division can be further confirmed, the occurrence of the area incapable of being divided is avoided, and the calculation of grid division is facilitated.
In an embodiment, the polyhedral mesh in the above embodiment is a hexahedral mesh, that is, the polyhedral meshes in the preliminary mesh body that is roughly divided are all hexahedral meshes, and the polyhedral meshes that are subsequently subdivided according to the tag values are all hexahedral meshes. In this embodiment, the divided polyhedral grid is taken as a hexahedral grid example, but other multi-hands-free grids, such as tetrahedral grids, etc., are also possible in practical application, and are not particularly limited. For convenience of explanation, in the following embodiments, a hexahedral mesh will be taken as an example or explanation, and the description is not limited.
In an embodiment, in step S20, that is, before assigning, in order from large to small, the depth values of the polyhedral mesh to each vertex and adjacent vertices of each polyhedral mesh in turn, a corresponding depth value as a label value, the method further includes the following steps: and according to the analysis requirements of the polyhedral grids, assigning corresponding depth values for the polyhedral grids, wherein the analysis requirements of the polyhedral grids are different, and the depth values corresponding to the polyhedral grids are also different.
In this embodiment, the analysis requirements of the polyhedral mesh may embody an analysis requirement force, and different depth values are assigned in response to the analysis requirement force. The analysis requirements of the polyhedral grids are different, and the corresponding depth values are also different. Illustratively, where analysis is of great concern, the depth values assigned are greater than at other locations. For example, as indicated by the above specified depth values including 0, 1 and 2, then a grid with a heavier analysis need would be assigned 2, a transition would be assigned 1, and insignificant locations would be assigned 0. In the embodiment, corresponding depth values can be automatically given by analyzing the analysis requirement of each polyhedral grid, so that basis and foundation are provided for subsequent grid division, and subsequent realization and division precision are ensured.
In an embodiment, in step S30, that is, the polyhedral mesh having the target tag value greater than the preset value is present in the polyhedral mesh, and then the polyhedral mesh is divided, including the following steps:
s31: and determining the number of the labels of the target label value in the polyhedral grid with the target label value larger than a preset value.
S32: determining a polyhedral dividing mode according to the number of the labels, and performing polyhedral mesh division on the polyhedral mesh with the target label value larger than a preset value according to the polyhedral dividing mode.
In step S31, after the label values of the polyhedral mesh and the adjacent mesh are given according to the depth value, the polyhedral mesh with the target label value larger than the preset value is determined, and then the number of labels with the target label value in the polyhedral mesh with the target label value larger than the preset value is determined. For example, continuing to take fig. 3 as an example, the preset value is set to zero, after the "MIN giving" is performed, it can be seen that, for example, since the label values of the eight vertices of the hexahedral mesh are all 0, it can be seen that the number of labels of the target note value is 0, and the hexahedral mesh is not continuously divided.
In an embodiment, for the hexahedral mesh, since the hexahedral mesh includes 8 vertices, that is, 8 tag values, there are 9 cases where the tag value of each hexahedral mesh is greater than 0, that is, 8 cases where the tag value is greater than or equal to 1, respectively: zero label value greater than or equal to 1 (No label. Gtoreq.1), as shown in FIG. 3; only one label value is greater than or equal to 1 (Only one label is greater than or equal to 1); two tag values greater than or equal to (two tags. Gtoreq.1), as shown in FIG. 4; three tag values greater than or equal to 1 (thread tags. Gtoreq.1); all tag values are greater than or equal to 1 (All tags. Gtoreq.1).
Here, the case of the label value is the case of the other polyhedral mesh, which is described by taking the polyhedral mesh as a hexahedron, and the case of the label value is not described by way of example.
In step S32, a polyhedral dividing manner is determined according to the number of labels, and polyhedral grids with the target label value larger than a preset value are subjected to polyhedral grid division according to the polyhedral dividing manner. That is, for polyhedral grids with label values greater than a preset value, the difference of the label values represents the requirement of user analysis, and the corresponding positions are required to be divided, so that the polyhedral dividing mode is determined according to the number of the labels, and the grid can be divided with pertinence and finer. When the polyhedral grid with the label value larger than the preset value does not exist, the division of the polyhedral grid is not needed.
It should be noted that, according to different specific shapes of the polyhedrons, the corresponding division modes are different according to the characteristics of the polyhedrons, but the process of dividing the polyhedral mesh again is realized, and the number of division times is controlled by the tag value, so that the purpose that the higher the depth value is, the more the division times are is obtained.
In this embodiment, a hexahedral mesh may be taken as an example, and how to determine a hexahedral mesh dividing manner according to the number of labels, and perform a hexahedral mesh dividing process on the hexahedral mesh with the label value greater than a preset value according to the hexahedral mesh dividing manner, where the manner adopted in the embodiment of the present application may be specifically as follows:
No label≥1
referring to fig. 3, the label values of a hexahedral mesh before division are shown in fig. 3, wherein it can be seen that the label values of eight vertices of the hexahedral mesh are all 0, so that the hexahedral mesh is not divided.
Only one label≥1
Referring to fig. 4, fig. 4 (a) is a schematic diagram of a hexahedral mesh before division, where i is a vertex label value (vertex label) greater than or equal to 1, and label values of the other seven vertices are all 0, that is, only one label value in the hexahedral mesh is greater than or equal to 1, and fig. 4 (b) is a schematic diagram of the hexahedral mesh after the hexahedral mesh of fig. 4 (a) is subdivided according to a three-component algorithm. It can be seen that, in the embodiment of the present application, the dividing manner refers to a process of dividing the length of three sides from three sides where the i vertex (vertex greater than or equal to 1) is located, and regenerating a new hexahedral mesh and an adjacent hexahedral mesh according to the three divided sides, as shown in fig. 4 (b). As shown in the schematic diagram of fig. 4 (C), it can be seen that the new hexahedral mesh divided includes four, including a hexahedral mesh a and hexahedral mesh B, hexahedral mesh C, and hexahedral mesh D adjacent to the hexahedral mesh a.
Second,: ALL labels not less than 1
Referring to fig. 5, fig. 5 (a) is a schematic diagram of a hexahedral mesh before division, where i respectively represents the vertex label values of the hexahedral mesh, which are all vertex label values (vertex label) greater than or equal to 1, that is, all label values in the hexahedral mesh are greater than or equal to 1, and fig. 5 (b) is a schematic diagram of the hexahedral mesh after the hexahedral mesh of fig. 5 (a) is subdivided according to a three-component algorithm. It can be seen that the three-division algorithm dividing mode in the embodiment of the application refers to the process of dividing lengths of two sides into three parts from three sides where i vertexes (vertexes greater than or equal to 1) are located, and re-dividing new hexahedral meshes and adjacent hexahedral meshes according to the three divided sides. As shown in the schematic diagram of fig. 5 (c), it can be seen that the new hexahedral mesh is divided to include twenty-seven.
In addition, for other cases (two labels are more than or equal to 1 or three labels are more than or equal to 1) in the hexahedral mesh, the concept can be used for dividing a new hexahedral mesh and corresponding label values again by using a trisection mode, and the like until the label values of all the hexahedral meshes are less than 0.
In the above case, in order to facilitate explanation of the relationship between the vertex label values of the newly divided hexahedral mesh, an example will be described with reference to fig. 6. In fig. 6, the coordinate calculation of any point P0, P1, P2 in all spaces follows the following equation (inner principle):
P 0 ＝(1-r 0 )trans [0] +r 0 trans [2] ....(1)
P 1 ＝(1-r 10 ) (1-r 11 ) trans [0] +(1-r 10 ) r 11 trans [1] +
r 10 (1-r 11 ) trans [2] +r 10 r 11 trans [3] .....(2)
P 2 ＝(1-r 20 )(1-r 21 ) (1-r 22 ) trans [0] +(1-r 20 ) r 21 (1-r 22 ) trans [1] +r 20 (1-r 21 ) (1-r 22 )trans [2] +r 20 r 21 (1-r 22 )trans [3] +r 20 (1-r 21 ) r 22 trans [4] +(1-r 20 ) r 21 r 22 trans [5] +r 20 (1-r 21 ) r 22 trans [6] +r 20 r 21 r 22 trans [7] .....(3)
wherein r is 0 、1-r 0 Is P 0 In the Y-axis direction, r 10 、1-r 10 And r 11 、1-r 11 P is 1 An inner division of Y axis and X axis, r 20 、1-r 20 And r 21 、1-r 21 And r 22 、1-r 22 P is 2 Internal division in Y-axis and X-axis and Z-axis directions, trans [0] trans [7] Is 8 vertex coordinates in the hexahedral mesh. I.e. all spatial points have only P 0 、P 1 、P 2 These three states exist, and the coordinates of these three states can be calculated from equation (1) and equation (3).
For example, referring to fig. 7-10, fig. 7-10 are several results illustrating the generation of a final mesh body from a preliminary mesh body using the mesh generation method of the embodiment of the present application, taking a hexahedral mesh as an example. In fig. 7, fig. 7 (a) shows a preliminary mesh body, and fig. 7 (b) shows a final mesh body generated by the mesh generation method according to the embodiment of the present application; in fig. 8, fig. 8 (a) shows a preliminary mesh body, and fig. 8 (b) shows a final mesh body generated by the mesh generation method according to the embodiment of the present application; in fig. 9, fig. 9 (a) shows a preliminary mesh body, and fig. 9 (b) shows a final mesh body generated by the mesh generation method provided according to the embodiment of the present application; in fig. 10, fig. 10 (a) shows a preliminary mesh body, and fig. 10 (b) shows a final mesh body generated by the mesh generation method provided according to the embodiment of the present application. It can be further seen from the above example that the higher the depth value, the more hexahedral mesh is finally divided, indicating that the corresponding position is a position that the user wants to analyze heavily.
In the above examples, the label value assignment process is described on the basis of depth values of 0, 1 and 2 and on the basis of a polyhedral grid of a hexahedral grid, and the method is not particularly limited. When changing to other polyhedrons and/or other depth values, there will be corresponding procedures, which are not described here.
In an embodiment, the polyhedral grids with the same depth values are assigned in parallel when assigning the tag values. For example, taking fig. 2 as an example, the hexahedral mesh with the depth value of 2 includes 2 hexahedral meshes, when the note values are given to the vertices and adjacent vertices of two hexahedral meshes, the parallel assignment processing can be performed, so that the purpose of parallel or even simultaneous calculation can be achieved, and the mesh division processing efficiency can be further improved.
In one embodiment, only one label value is assigned to each vertex in the polyhedral mesh. For example, when the vertices and adjacent vertices of each hexahedral mesh are the same depth value, some vertices may be given the same or similar label value, in this embodiment, the same vertex may eliminate the same label value, or take any one from the similar label values, so as to achieve the purpose of automatically eliminating the same coincident label value. In some embodiments, the label value distance from the same vertex is 10 -6 And if the label value belongs to the same label value, the method ensures that the note value of each vertex has uniqueness, so that grid division can be sustainable.
In an embodiment, after step S30, each vertex of the newly divided polyhedral mesh is given a new label value, until all label values of the divided polyhedral mesh are smaller than the preset value, and the method further includes the following steps:
s40: and taking the grids when the label values of all the polyhedral grids are smaller than the preset value as final grid bodies, and generating a simulation import file through the final grid bodies.
In this embodiment, when the tag values of all the divided polyhedral grids are smaller than the preset value, the division calculation is terminated, the division of the grids is completed, and then a simulation import file is generated according to the final divided grid body and can be used for importing simulation software, so that the simulation software can perform simulation analysis work on the evaluation part according to the final divided grid body. The above-mentioned simulation import file may be a TXT format file, which is not limited in particular.
In an embodiment, as shown in fig. 11, the embodiment of the application further provides a structure simulation analysis method, which includes the following steps:
S101: obtaining a final grid body obtained based on the grid generation method;
s102: and carrying out simulation analysis on the evaluation part according to the final grid body.
In this embodiment, in addition to providing a grid generating method, a structural simulation analysis method is provided based on the grid generating method, and by this embodiment, the generating process of the final grid body may correspond to the foregoing embodiment, and will not be described herein repeatedly. The final grid body generation process has extremely high efficiency, correspondingly improves the simulation analysis efficiency, and the generated subdivision grids are automatically generated based on the appointed depth values, so that the grid body generation process is more accurate and rapid, the precision and time are greatly improved, and the grid body generation process has higher application value.
In addition, it is worth to be explained that, in the test process, the inventor respectively performs the analysis on the preliminary grid body (without division) and the analysis result with the lowest precision, and the final grid body with the depth value equal to 2 is high in analysis result precision (global division), and the analysis result precision of the final grid body generated after different depth values are given to different grid surfaces by adopting the embodiment of the application is highest (local division), for example, the simulation analysis result precision of the locally refined depth values=0, 1 and 2 in the above example is within ±3% of the global refinement, so that the simulation precision is effectively improved, and the application scene and popularization value are higher.
In addition, in the simulation analysis, different depth values can be set according to development requirements, only the relevant positions of the evaluation part are subjected to refinement and division, and other areas are subjected to rough division, so that the operation efficiency is improved. The specific method comprises the following steps:
the 3D SOLID shape is made in CATIA software, a coarse grid body (Depth 0) is divided in grid division software, and the evaluation part is found out through first analysis. And the TXT file is exported, the exported TXT file is imported into a software code for realizing the grid generation method developed by the patent, the depth value of each unit body is designated, the label values are sequentially given according to the depth value, each MAX value automatically searches the label value according to the algorithm, and 1 is subtracted once calculated, so that the calculation is continued until the label value=0 of all unit bodies. The model of the computation termination is exported to the TXT file. And importing the derived automatically divided TXT file into simulation software for analysis and evaluation. It can be seen that if there is a rich experience in simulation analysis, the evaluation site can be predicted, and a higher depth value can be directly specified at the predicted site without the need for the first-step analysis. It is noted that as in the previous analysis, the higher the Depth value, the more meshes are automatically generated, the longer the calculation time is needed, so it is recommended to select a reasonable Depth value, and it is sufficient to perform the general structural simulation analysis with depth=2.
In summary, the scheme provided by the embodiment of the application can automatically divide the final mesh body, is practically feasible, saves a great deal of manual work due to the automatic division, has higher efficiency, ensures the precision of the hexahedron divided in the aspect of result precision, and has better applicability in simulation analysis.
It should be understood that the sequence number of each step in the foregoing embodiment does not mean that the execution sequence of each process should be determined by the function and the internal logic, and should not limit the implementation process of the embodiment of the present application.
In an embodiment, a mesh generation apparatus is provided, which corresponds to the mesh generation method in the above embodiment one by one. As shown in fig. 12, the mesh generation apparatus includes an acquisition module 101 and a processing module 102. The functional modules are described in detail as follows:
an acquisition module 101, configured to acquire a preliminary mesh body of an evaluation site, where the preliminary mesh body includes a plurality of polyhedral meshes;
the processing module 102 is configured to assign, in order from large to small, corresponding depth values to each vertex and adjacent vertices of each polyhedral mesh in sequence as tag values, where the assigned vertices do not repeatedly assign the tag values; and carrying out polyhedral mesh division on polyhedral meshes with target label values larger than a preset value in the polyhedral meshes, and endowing each vertex of the newly divided polyhedral meshes with a new label value until the label values of all the divided polyhedral meshes are smaller than the preset value, wherein the new label value is smaller than the target label value.
In combination with the above embodiment, the preliminary mesh body includes a plurality of hexahedral meshes.
In combination with the above embodiment, the processing module 102 is specifically configured to:
determining the number of labels of the target label value in a polyhedral grid with the target label value larger than a preset value;
determining a polyhedral dividing mode according to the number of the labels, and performing polyhedral mesh division on the polyhedral mesh with the target label value larger than a preset value according to the polyhedral dividing mode.
In combination with the above embodiment, the processing module 102 is further configured to: before label values are given to each vertex and adjacent vertices of each polyhedral grid in sequence according to the sequence from big to small of the depth values of the polyhedral grids, corresponding depth values are given to the polyhedral grids according to the analysis requirements of the polyhedral grids, wherein the analysis requirements of the polyhedral grids are different, and the depth values corresponding to the polyhedral grids are also different.
In combination with the above embodiment, the processing module 102 is further configured to:
and taking the grids when the label values of all the polyhedral grids are smaller than the preset value as final grid bodies, and generating a simulation import file through the final grid bodies.
In combination with the above embodiment, the polyhedral grids having the same depth value are given in parallel when the tag value is given.
In one embodiment, a structure simulation analysis device is provided, which corresponds to the structure simulation analysis method in the above embodiment one by one. As shown in fig. 13, the mesh generation apparatus includes an acquisition module 201 and a processing module 202. The functional modules are described in detail as follows:
the acquisition module acquires a final grid body generated by the grid generation method;
and the processing module is used for carrying out simulation analysis on the evaluation part by utilizing the final grid body.
For specific limitations of the grid generating apparatus or the structure simulation analysis apparatus, reference may be made to the above limitations of the grid generating method or the structure simulation analysis method, and no further description is given here. The respective modules in the above-described mesh generation apparatus or structure simulation analysis apparatus may be implemented in whole or in part by software, hardware, and combinations thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In one embodiment, a computer device is provided, which may be a terminal, and the internal structure thereof may be as shown in fig. 14. The computer device includes a processor, a memory, and a network interface coupled by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The nonvolatile storage medium stores a computer program. The internal memory provides an environment for the execution of computer programs in the non-volatile storage medium. The computer program is executed by a processor to implement a grid generation method or a structural simulation analysis method.
In one embodiment, a computer device is provided that includes a memory, a processor, and computer readable instructions stored on the memory and executable on the processor, when executing the computer readable instructions, performing the steps of:
acquiring a preliminary grid body of an evaluation part, wherein the preliminary grid body comprises a plurality of polyhedral grids;
according to the sequence of the depth values of the polyhedral grids from large to small, sequentially assigning a label value to each vertex and adjacent vertices of each polyhedral grid, wherein the vertex which is not assigned with the label value and the adjacent vertex which is not assigned with the label value in the polyhedral grid are assigned with the depth values corresponding to the polyhedral grid;
And carrying out polyhedral mesh division on polyhedral meshes with target label values larger than a preset value in the polyhedral meshes, and endowing each vertex of the newly divided polyhedral meshes with a new label value until the label values of all the divided polyhedral meshes are smaller than the preset value, wherein the new label value is smaller than the target label value.
In one embodiment, one or more computer-readable storage media are provided having computer-readable instructions stored thereon, the readable storage media provided by the present embodiment including non-volatile readable storage media and volatile readable storage media. The readable storage medium has stored thereon computer readable instructions that when executed by one or more processors implement a grid generation method or a structural simulation analysis method, and in particular are not repeated here.
Those skilled in the art will appreciate that implementing all or part of the above described embodiment methods may be accomplished by instructing the associated hardware by computer readable instructions stored on a non-volatile readable storage medium or a volatile readable storage medium, which when executed may comprise the above described embodiment methods. Any reference to memory, storage, database, or other medium used in embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of the functional units and modules is illustrated, and in practical application, the above-described functional distribution may be performed by different functional units and modules according to needs, i.e. the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-described functions.
The above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application.
Claims (11)
1. A method of grid generation, comprising:
acquiring a preliminary grid body of an evaluation part, wherein the preliminary grid body comprises a plurality of polyhedral grids;
According to the sequence from big to small of the depth values of the polyhedral grids, corresponding depth values are sequentially given to each vertex and adjacent vertices of each polyhedral grid as tag values, and the given vertex is not repeatedly given with the tag values;
and carrying out polyhedral mesh division on polyhedral meshes with target label values larger than a preset value in the polyhedral meshes, and endowing each vertex of the newly divided polyhedral meshes with a new label value until the label values of all the divided polyhedral meshes are smaller than the preset value, wherein the new label value is smaller than the target label value.
2. The grid generating method according to claim 1, wherein the preliminary grid body includes a plurality of hexahedral grids.
3. The mesh generation method as claimed in claim 1, wherein the step of performing polyhedral mesh division on polyhedral meshes having a target tag value greater than a preset value in the polyhedral meshes comprises:
determining the number of labels of the target label value in a polyhedral grid with the target label value larger than a preset value;
determining a polyhedral dividing mode according to the number of the labels, and performing polyhedral mesh division on the polyhedral mesh with the target label value larger than a preset value according to the polyhedral dividing mode.
4. The mesh generation method according to claim 1, wherein before assigning a label value to each vertex and adjacent vertices of each of the polyhedral meshes in order of the depth values of the polyhedral meshes from the top to the bottom, the method further comprises:
and according to the analysis requirements of the polyhedral grids, assigning corresponding depth values for the polyhedral grids, wherein the analysis requirements of the polyhedral grids are different, and the depth values corresponding to the polyhedral grids are also different.
5. The mesh generation method of claim 1, wherein a new label value is assigned to each vertex of the newly divided polyhedral mesh until the label values of all the divided polyhedral meshes are smaller than the preset value, and the method further comprises:
and taking the grid body when the label values of all the polyhedral grids are smaller than the preset value as a final grid body, and generating a simulation import file through the final grid body.
6. The mesh generation method according to any one of claims 1 to 5, wherein the polyhedral mesh having the same depth value is given in parallel when the tag value is given.
7. A structural simulation analysis method, comprising:
obtaining a final mesh body generated by the mesh generation method according to any one of claims 1 to 6;
and performing simulation analysis on the evaluation part by utilizing the final grid body.
8. A grid generating apparatus, comprising:
the acquisition module is used for acquiring a preliminary grid body of the evaluation part, wherein the preliminary grid body comprises a plurality of polyhedral grids;
the processing module is used for sequentially giving corresponding depth values as tag values to each vertex and adjacent vertices of each polyhedral grid according to the sequence from big to small of the depth values of the polyhedral grid, and the assigned vertices are not repeatedly given the tag values; and carrying out polyhedral mesh division on polyhedral meshes with target label values larger than a preset value in the polyhedral meshes, and endowing each vertex of the newly divided polyhedral meshes with a new label value until the label values of all the divided polyhedral meshes are smaller than the preset value and the label values of the newly divided polyhedral meshes are smaller than the target label value.
9. A structural simulation analysis apparatus, comprising:
An acquisition module for acquiring a final mesh body generated by the mesh generation method according to any one of claims 1 to 6;
and the processing module is used for carrying out simulation analysis on the evaluation part by utilizing the final grid body.
10. A computer device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the grid generating method according to any one of claims 1 to 6 or the steps of the structural simulation analysis method according to claim 7 when executing the computer program.
11. A computer-readable storage medium storing a computer program, characterized in that the computer program when executed by a processor implements the grid generating method according to any one of claims 1 to 6 or the steps of the structure simulation analysis method according to claim 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210318419.6A CN116934997A (en) | 2022-03-29 | 2022-03-29 | Grid generation and structure simulation analysis method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210318419.6A CN116934997A (en) | 2022-03-29 | 2022-03-29 | Grid generation and structure simulation analysis method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116934997A true CN116934997A (en) | 2023-10-24 |
Family
ID=88377574
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210318419.6A Pending CN116934997A (en) | 2022-03-29 | 2022-03-29 | Grid generation and structure simulation analysis method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116934997A (en) |
-
2022
- 2022-03-29 CN CN202210318419.6A patent/CN116934997A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110516370B (en) | Prefabricated part deepening drawing generation method and device, computer equipment and medium | |
| CN113688545B (en) | Visualization method and system for finite element post-processing result and data processing terminal | |
| US20150127301A1 (en) | Updating A CAD Model To Reflect Global Or Local Shape Changes | |
| CN115794414B (en) | Satellite earth-to-earth view analysis method, device and equipment based on parallel computing | |
| CN111859763A (en) | Finite element simulation method, system and medium | |
| CN110688798B (en) | Deformation prediction method, device, equipment and storage medium for shell structural part | |
| CN111444573B (en) | Ship symmetric segment model generation method and device, storage medium and terminal | |
| CN114626273A (en) | Finite element parametric modeling method for hexahedral gridding divided bolt and nut | |
| US20160267352A1 (en) | System and method for constructing a statistical shape model | |
| US7388584B2 (en) | Method and program for determining insides and outsides of boundaries | |
| CN116934997A (en) | Grid generation and structure simulation analysis method, device, equipment and storage medium | |
| CN109360215B (en) | Method, device and equipment for searching outer contour of three-dimensional model and storage medium | |
| CN112395660A (en) | Modeling operating regions for manufacturing resources using virtual models and graph-based simulations | |
| CN115222913B (en) | Grid generation and structure simulation analysis method, device, equipment and storage medium | |
| CN115272379B (en) | Projection-based three-dimensional grid model outline extraction method and system | |
| CN106600671A (en) | Grid model voxelization method and apparatus | |
| CN112632679A (en) | Building information model scene rendering method and device and computer equipment | |
| JP2004272782A (en) | Method and system for generating shape data | |
| CN112231800A (en) | BIM graph optimization method and device and computer storage medium | |
| JP4622987B2 (en) | Tool reference plane data creation device and creation method | |
| CN110704897A (en) | Method for placing connecting node between wall keel model and bottom guide beam model and product | |
| CN110704900B (en) | Method for placing connection node between keel column model and wall keel model and product | |
| CN113793352B (en) | Laser filling method and device for single-layer outline pattern based on contour lines | |
| CN112991492B (en) | Curved surface curtain wall generation method and device, computer equipment and readable storage medium | |
| Klein et al. | A procedure for the evaluation and compensation of form errors by means of global isometric registration with subsequent local reoptimization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |