CN110807286A - Structural grid identification method - Google Patents
Structural grid identification method Download PDFInfo
- Publication number
- CN110807286A CN110807286A CN201911069757.5A CN201911069757A CN110807286A CN 110807286 A CN110807286 A CN 110807286A CN 201911069757 A CN201911069757 A CN 201911069757A CN 110807286 A CN110807286 A CN 110807286A
- Authority
- CN
- China
- Prior art keywords
- unit
- edge
- list
- sharing
- units
- 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
- 238000000034 method Methods 0.000 title claims abstract description 47
- 238000012216 screening Methods 0.000 claims abstract description 8
- 238000000547 structure data Methods 0.000 claims description 6
- 230000001351 cycling effect Effects 0.000 claims description 3
- 238000005094 computer simulation Methods 0.000 abstract description 3
- 238000012545 processing Methods 0.000 abstract description 3
- 238000013461 design Methods 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 5
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 3
- 230000001413 cellular effect Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000008140 language development Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
Images
Landscapes
- Stored Programmes (AREA)
Abstract
The invention relates to the technical field of computer simulation, in particular to a structural grid identification method, which comprises the steps of screening two-dimensional units; acquiring a unit edge list; searching for a shared edge; judging a virtual pole; and judging whether the two 2D units are coplanar. The embodiment of the invention mainly develops a 3D graphic engine based on Python language, a graphic interface based on wxPython, a refined finite element model, and a natural grid for processing the connected units with the same structural characteristics according to the attributes and the mutual connection relation of the unit structure, so that the follow-up operation based on the natural grid becomes possible, and no correlation exists between the grid units and the node ID.
Description
Technical Field
The invention relates to the technical field of computer simulation, in particular to a structural grid identification method.
Background
The finite element method is used as an effective analysis method in the existing computer simulation field, and is widely applied to the fields of aerospace, automobiles and the like.
The number of the finite element meshes will affect the accuracy of the calculation result and the size of the calculation scale. Generally, the required mesh size will vary from design analysis stage to design analysis stage for the same component structure.
For example: in the initial stage of design, considering the calculation scale, the grid size is generally larger, and the unit structure with the same structural feature usually corresponds to one grid unit, as shown in fig. 1; entering a detailed design stage, considering the influence of calculation precision and calculation scale, the grid size is refined, and at this time, a region (a structural unit) with the same characteristics is refined into a plurality of grids with smaller sizes, as shown in fig. 2. After the structural unit is identified, the information data contained in the characteristic region is independent of the structural unit and is not influenced by the fine grids, so that the data information of the whole structural unit can be conveniently identified and sorted.
However, the above method has a certain limitation at present, and after the data volume reaches a certain scale, because of the large number of involved cycles, the large data processing volume, the slow recognition speed, the optimization algorithm has a further optimization space.
Disclosure of Invention
In view of the above-mentioned shortcomings of the prior art, it is an object of the present invention to provide an efficient and fast method for identifying a structural grid.
The embodiment of the invention provides a structural grid identification method, which comprises the following steps:
1) acquiring unit structure data;
2) calculating the dimension of a unit structure;
3) screening out 2D units by analyzing the imported unit structure characteristics;
4) cycling 2D cell data
5) Acquiring a unit structure side list;
6) searching an edge sharing unit according to the edge, and finding out all 1D sharing units and 2D sharing units connected with the edge;
7) judging whether the 1D sharing unit exists or not, if so, judging whether the 1D sharing unit is a virtual rod with a small sectional area or not, and if the unit boundary has neither the 1D sharing unit nor the 2D sharing unit, taking the edge as a free edge;
8) when the 1D sharing unit is a virtual rod, omitting the one-dimensional unit; when the 1D sharing unit is not a virtual rod, determining the edge as a unit boundary, and deleting the edge from the edge list acquired in the step 5);
9) judging whether the 2D sharing unit exists, if so, performing 2D sharing unit circulation, and judging whether the 2D sharing unit is the same as the current circulation unit in the step 4).
10) When the 2D sharing unit is the same as the current cycle unit in the step 4), deleting the edge from the edge list; if not, judging whether the two units are coplanar;
11) if the two units are coplanar, it is determined whether the 2D sharing unit has been assigned the ID number of the structural unit, and if the two units are not coplanar, it is determined whether the 2D sharing unit has been assigned the ID number of the structural unit.
13) If the 2D shared unit has the structure unit ID number, deleting the 2D unit from the 2D structure data in the step 3), and if the 2D shared unit has no structure unit ID number, adding the 2D shared unit to a unit list of the structure unit;
14) acquiring a searched unit structure edge list, merging the searched unit structure edge list with the rest edge list in the step 5), continuing to circulate edge data in the edge list after merging is finished, and if the data in the edge list is empty, indicating that the circulation of the current 2D unit is finished; and if the 2D unit data in the step 4) is empty, indicating that the structural grid identification is finished.
Further, in the above method, the 2D cells include quadrilateral cells and triangular cells.
Further, in the above method, after the screening of the 2D cell, the method further includes:
1)2D unit circulation;
2) judging whether the 2D unit acquires the structural unit information;
3) if so, the 2D unit loop is skipped, and if not, the structural unit data is newly built.
Further, in the above method, after the obtaining the unit structure edge list, the method further includes:
1) judging whether the edge list is empty or not;
2) if yes, the 2D unit loop is skipped, and if not, a side loop is performed.
Further, in the above method, the process of searching for the edge sharing unit according to the edge includes:
1) acquiring a list consisting of edges of the unit structure, wherein the list consists of node coordinates and is stored in a dictionary taking the unit structure as key;
2) acquiring a sharing unit list of nodes, and storing the sharing unit list into a dictionary with the node number as a key;
3) and searching the shared unit of the edge according to the two dictionary data.
Further, in the above method, whether the virtual pole is determined according to the following method: the 1D unit with the unit structure sectional area smaller than 10mm is a virtual rod.
Further, in the above method, the method for determining whether the two 2D cells are coplanar is as follows:
1) calculating the cell normal directions of the two 2D cells;
2) and calculating a normal included angle of the two 2D units, and judging that the two units are coplanar when the included angle is smaller than a set threshold value.
Further, in the above method, when the set threshold α is less than 30 ° or α is less than 150 °, the two cells are coplanar.
Compared with the prior art, the structural grid identification method comprises the steps of screening two-dimensional units; acquiring a unit edge list; searching for a shared edge; judging a virtual pole; and judging whether the two 2D units are coplanar. The embodiment of the invention mainly develops a 3D graphic engine based on Python language, a graphic interface based on wxPython, a refined finite element model, and a natural grid for processing the connected units with the same structural characteristics according to the attributes and the mutual connection relation of the unit structure, so that the follow-up operation based on the natural grid becomes possible, and no correlation exists between the grid units and the node ID.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
FIG. 1 is a diagram of a prior art cellular grid model at an early stage of design;
FIG. 2 is a schematic diagram of a prior art cellular grid model at a detailed design stage;
FIG. 3 is a simplified flowchart of a structural grid identification method according to the present invention;
fig. 4 is an overall flowchart of a structural grid identification method provided by the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The method mainly realizes structural grid recognition through Python language development, VTK-based 3D graphic engine development and wxPython-based graphical interface development.
The embodiments of the present invention will be described in further detail with reference to the drawings attached hereto.
As shown in fig. 3 and 4, an embodiment of the present invention discloses a structural grid identification method, including:
1) acquiring unit structure data;
2) calculating the dimension of a unit structure;
3) screening out 2D units by analyzing the imported unit structure characteristics;
4) cycling 2D cell data
5) Acquiring a unit structure side list;
6) searching an edge sharing unit according to the edge, and finding out all 1D sharing units and 2D sharing units connected with the edge;
7) judging whether the 1D sharing unit exists or not, if so, judging whether the 1D sharing unit is a virtual rod with a small sectional area or not, and if the unit boundary has neither the 1D sharing unit nor the 2D sharing unit, taking the edge as a free edge;
8) when the 1D sharing unit is a virtual rod, omitting the one-dimensional unit; when the 1D sharing unit is not a virtual rod, determining the edge as a unit boundary, and deleting the edge from the edge list acquired in the step 5);
9) judging whether the 2D sharing unit exists, if so, performing 2D sharing unit circulation, and judging whether the 2D sharing unit is the same as the current circulation unit in the step 4).
10) When the 2D sharing unit is the same as the current cycle unit in the step 4), deleting the edge from the edge list; if not, judging whether the two units are coplanar;
11) if the two units are coplanar, it is determined whether the 2D sharing unit has been assigned the ID number of the structural unit, and if the two units are not coplanar, it is determined whether the 2D sharing unit has been assigned the ID number of the structural unit.
13) If the 2D shared unit has the structure unit ID number, deleting the 2D unit from the 2D structure data in the step 3), and if the 2D shared unit has no structure unit ID number, adding the 2D shared unit to a unit list of the structure unit;
14) acquiring a searched unit structure edge list, merging the searched unit structure edge list with the rest edge list in the step 5), continuing to circulate edge data in the edge list after merging is finished, and if the data in the edge list is empty, indicating that the circulation of the current 2D unit is finished; and if the 2D unit data in the step 4) is empty, indicating that the structural grid identification is finished.
According to the embodiment of the invention, aiming at a refined finite element model and aiming at the attribute and the mutual connection relation of the units, the connected units with the same structural characteristics are treated as a natural grid, so that the subsequent operation based on the natural grid becomes possible, and no correlation exists between the grid units and the node IDs.
Preferably, in the above method, the 2D cells include quadrilateral cells and triangular cells.
Further, as shown in fig. 4, after the screening out the 2D cell, the method further includes:
1)2D unit circulation;
2) judging whether the 2D unit acquires the structural unit;
3) if so, the 2D unit loop is skipped, and if not, the structural unit data is newly built.
Further, as shown in fig. 4, after the obtaining the unit structure edge list, the method further includes:
1) judging whether the edge list is empty or not;
2) if yes, the 2D unit loop is skipped, and if not, a side loop is performed.
Further, in the above method, the process of searching for the edge sharing unit according to the edge includes:
1) acquiring a list consisting of edges of the unit structure, wherein the list consists of node coordinates and is stored in a dictionary taking the unit structure as key; for example, ditt _ eid _ side [7121406] [ [314106, 314105], [314106, 313106], [313106, 313105], [313105, 314105] ].
2) Acquiring a sharing unit list of nodes, and storing the sharing unit list into a dictionary with the node number as a key; in the following table, the node number is 313105, and dit _ node _ shareid [313105], [7121406, 7181305, 7121306, 7111305, 7121305, 7181304, 7121405, 7111405 ].
| 314106 | 7111406 | 313106 | 7111306 | 312106 |
| 7181405 | 7121406 | 7181305 | 7121306 | 7181205 |
| 314105 | 7111405 | 313106 | 7111305 | 312105 |
| 7181404 | 7121405 | 7181304 | 7121305 | 7181204 |
| 314104 | 7111404 | 313104 | 7111304 | 312104 |
3) And searching the shared unit of the edge according to the two dictionary data.
In one embodiment, the shared edge is found according to the edge, and all 1D cells and 2D cells connected to the edge are found, and the list of shared cells is [7121406, 7181305, 7121306] taking the edge [313106, 313105] as an example in the above table. At this time, the cell 7181305 is a shared 1D cell, and [7121406, 7121306] is a shared 2D cell.
Preferably, in the above method, whether the virtual bar is determined according to the following method: the 1D unit with the unit structure sectional area smaller than 10mm is a virtual rod. In the implementation, the default virtual rod is defined as a 1D unit with a unit cross-sectional area smaller than 10mm, and it should be noted that the virtual rod can also be customized according to the actual situation.
Further, in the above method, the method for determining whether the two 2D cells are coplanar is as follows:
1) calculating the cell normal directions of the two 2D cells;
2) and calculating a normal included angle of the two 2D units, and judging that the two units are coplanar when the included angle is smaller than a set threshold value.
Preferably, in the above method, when the set threshold α is less than 30 ° or α is less than 150 °, the two cells are coplanar.
To sum up, the embodiment of the invention develops a 3D graphic engine based on VTK through Python language development, develops a graphic interface based on wxPython, processes connected units with the same structural characteristics as a natural grid aiming at a refined finite element model and aiming at the attribute and interconnection relation of the units, so that the follow-up operation based on the natural grid becomes possible, and no correlation exists between the grid units and the node IDs. The invention provides an efficient and rapid finite element mesh identification method by analyzing the characteristics of the shared units of the 2D units to judge the types of edges.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (8)
1. A method for identifying a structural grid, the method comprising:
1) acquiring unit structure data;
2) calculating the dimension of a unit structure;
3) screening out 2D units by analyzing the imported unit structure characteristics;
4) cycling 2D cell data
5) Acquiring a unit structure side list;
6) searching an edge sharing unit according to the edge, and finding out all 1D sharing units and 2D sharing units connected with the edge;
7) judging whether the 1D sharing unit exists or not, if so, judging whether the 1D sharing unit is a virtual rod with a small sectional area or not, and if the unit boundary has neither the 1D sharing unit nor the 2D sharing unit, taking the edge as a free edge;
8) when the 1D sharing unit is a virtual rod, omitting the one-dimensional unit; when the 1D sharing unit is not a virtual rod, determining the edge as a unit boundary, and deleting the edge from the edge list acquired in the step 5);
9) judging whether the 2D sharing unit exists, if so, performing 2D sharing unit circulation, and judging whether the 2D sharing unit is the same as the current circulation unit in the step 4).
10) When the 2D sharing unit is the same as the current cycle unit in the step 4), deleting the edge from the edge list; if not, judging whether the two units are coplanar;
11) if the two units are coplanar, it is determined whether the 2D sharing unit has been assigned the ID number of the structural unit, and if the two units are not coplanar, it is determined whether the 2D sharing unit has been assigned the ID number of the structural unit.
13) If the 2D shared unit has the structure unit ID number, deleting the 2D unit from the 2D structure data in the step 3), and if the 2D shared unit has no structure unit ID number, adding the 2D shared unit to a unit list of the structure unit;
14) acquiring a searched unit structure edge list, merging the searched unit structure edge list with the rest edge list in the step 5), continuing to circulate edge data in the edge list after merging is finished, and if the data in the edge list is empty, indicating that the circulation of the current 2D unit is finished; and if the 2D unit data in the step 4) is empty, indicating that the structural grid identification is finished.
2. The method of claim 1, wherein the 2D cells comprise quadrilateral cells and triangular cells.
3. The method of claim 1 or 2, wherein after screening out the 2D cell, further comprising:
1)2D unit circulation;
2) judging whether the 2D unit acquires the ID number of the structural unit;
3) if so, the 2D unit loop is skipped, and if not, the structural unit data is newly built.
4. The method of claim 1, wherein after obtaining the list of unit structure edges, further comprising:
1) judging whether the edge list is empty or not;
2) if yes, the 2D unit loop is skipped, and if not, a side loop is performed.
5. The method of claim 1, wherein the step of finding the shared units of the edge according to the edge comprises:
1) acquiring a list consisting of edges of the unit structure, wherein the list consists of node coordinates and is stored in a dictionary taking the unit structure as key;
2) acquiring a sharing unit list of nodes, and storing the sharing unit list into a dictionary with the node number as a key;
3) and searching the shared unit of the edge according to the two dictionary data.
6. The method of claim 1, wherein determining whether the pole is a virtual pole is based on: the 1D unit with the unit structure sectional area smaller than 10mm is a virtual rod.
7. The method of claim 1, wherein the method for determining whether the two 2D cells are coplanar is as follows:
1) calculating the cell normal directions of the two 2D cells;
2) and calculating a normal included angle of the two 2D units, and judging that the two units are coplanar when the included angle is smaller than a set threshold value.
8. The method of claim 7, wherein the set threshold α <30 ° or α <150 ° is two cells coplanar.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911069757.5A CN110807286A (en) | 2019-11-05 | 2019-11-05 | Structural grid identification method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911069757.5A CN110807286A (en) | 2019-11-05 | 2019-11-05 | Structural grid identification method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110807286A true CN110807286A (en) | 2020-02-18 |
Family
ID=69501138
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911069757.5A Pending CN110807286A (en) | 2019-11-05 | 2019-11-05 | Structural grid identification method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110807286A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111024021A (en) * | 2019-12-09 | 2020-04-17 | 江南造船(集团)有限责任公司 | Ship plate part polishing edge judgment method |
| CN115344530A (en) * | 2022-10-18 | 2022-11-15 | 西安电子科技大学 | VTK format-based multi-physical-field single data file representation method |
-
2019
- 2019-11-05 CN CN201911069757.5A patent/CN110807286A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111024021A (en) * | 2019-12-09 | 2020-04-17 | 江南造船(集团)有限责任公司 | Ship plate part polishing edge judgment method |
| CN111024021B (en) * | 2019-12-09 | 2021-09-28 | 江南造船(集团)有限责任公司 | Ship plate part polishing edge judgment method |
| CN115344530A (en) * | 2022-10-18 | 2022-11-15 | 西安电子科技大学 | VTK format-based multi-physical-field single data file representation method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109189991B (en) | Duplicate video identification method, device, terminal and computer readable storage medium | |
| CN110287942B (en) | Training method of age estimation model, age estimation method and corresponding device | |
| CN108154198B (en) | Knowledge base entity normalization method, system, terminal and computer readable storage medium | |
| CN109685092B (en) | Clustering method, equipment, storage medium and device based on big data | |
| CN109145003B (en) | Method and device for constructing knowledge graph | |
| CN114782970B (en) | Table extraction method, system and readable medium | |
| CN109857957B (en) | Method for establishing label library, electronic equipment and computer storage medium | |
| CN111967545B (en) | Text detection method and device, electronic equipment and computer storage medium | |
| CN110895533B (en) | Form mapping method and device, computer equipment and storage medium | |
| CN110807286A (en) | Structural grid identification method | |
| CN112307860A (en) | Image recognition model training method and device and image recognition method and device | |
| CN111258905B (en) | Defect positioning method and device, electronic equipment and computer readable storage medium | |
| CN110083731B (en) | Image retrieval method, device, computer equipment and storage medium | |
| CN109871743B (en) | Text data positioning method and device, storage medium and terminal | |
| CN111597336B (en) | Training text processing method and device, electronic equipment and readable storage medium | |
| CN110598194B (en) | Non-full-grid table content extraction method and device and terminal equipment | |
| CN109657710B (en) | Data screening method and device, server and storage medium | |
| CN110209895B (en) | Vector retrieval method, device and equipment | |
| CN113361584B (en) | Model training method and device, and pulmonary arterial hypertension measurement method and device | |
| CN113486976B (en) | Automatic classification method and device for map annotation content | |
| CN108475339B (en) | Method and system for classifying objects in an image | |
| CN111984812B (en) | Feature extraction model generation method, image retrieval method, device and equipment | |
| CN114495144A (en) | Method and device for extracting form key-value information in text image | |
| CN108021918B (en) | Character recognition method and device | |
| CN111191665A (en) | Image classification method and device and electronic equipment |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200218 |