CN111400969B - Method for accelerating generation of unstructured right-angle grid - Google Patents
Method for accelerating generation of unstructured right-angle grid Download PDFInfo
- Publication number
- CN111400969B CN111400969B CN202010172253.2A CN202010172253A CN111400969B CN 111400969 B CN111400969 B CN 111400969B CN 202010172253 A CN202010172253 A CN 202010172253A CN 111400969 B CN111400969 B CN 111400969B
- Authority
- CN
- China
- Prior art keywords
- grid
- flow field
- plate
- background
- grids
- 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.)
- Active
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an unstructured right-angle grid accelerated generation method, which comprises the following steps: describing the shape of the object to generate a background grid; partitioning the background grid; setting grid generation parameters; generating a cross tree structure according to the partitioned background grids and the set parameters; deleting units inside the object shape and intersecting the object shape to generate a sawtooth-shaped inner surface; smoothing the sawtooth-shaped inner surface to obtain a smoothed inner surface; accelerating generation and projection are carried out on the smooth rear inner surface; and calculating the grid amount and outputting grid information. The invention solves the problem of longer grid generation time caused by the fact that a large number of background grid nodes need to be searched when a right-angle grid is generated, a cross tree structure is divided, cutting and projection are carried out in computational fluid mechanics, and can greatly reduce the number of the background grids needing to be searched by partitioning the background grids and accelerate grid generation on the premise of not influencing grid quality.
Description
Technical Field
The invention relates to an unstructured right-angle grid accelerated generation method, and belongs to the technical field of grid generation methods.
Background
Computational Fluid Dynamics (CFD) is an important means in a modern fluid mechanics research method, and a grid generation technology is a key link in the CFD. The computational mesh may be divided into a structured mesh and an unstructured mesh according to the mesh type division. The structural grid nodes change orderly, the solving efficiency and the solving precision are higher, but the complex appearance is more complicated to process; the node and the unit of the unstructured grid are formed randomly, the appearance is processed flexibly, the unstructured grid is more suitable for complex appearance, and the unstructured right-angle grid belongs to the category of unstructured grids.
The geometric shape of the aircraft required by grid generation is provided according to a surface triangularization mode, and a required background grid is obtained according to coordinate point information of the surface grid. The method comprises the steps of firstly selecting a calculated flow field area for generating grids in a mode of a cross-tree structure, taking a large cuboid to surround a whole aircraft, uniformly dividing the cuboid, and then uniformly dividing a calculation domain to ensure that the length of each side of a unit is close to the length of each side as much as possible, wherein the generated grids are initial grids. The grid is subjected to multi-layer encryption according to the distance relation between the unit and the object plane on the basis of the initial grid, so that the grid meets the calculation requirement, and a complete cross-tree grid is generated, wherein the process of realizing grid encryption is that the unit one is divided into eight in an octree manner as shown in figure 1.
Because each grid surface and each edge of the right-angle grid are completely orthogonal, an object to be fitted may be any shape, the original right-angle grid often cannot be completely fitted at the boundary of the object surface, and one processing mode is to smooth and project grid points in a flow field when the boundary is processed to generate a fitted grid.
The arithmetic processes such as aggregation, intersection, subtraction, and the like in the graphics processing operation are generally called boolean operations, and boolean operations mainly present in the generation of a rectangular grid are intersection operations. In the process of generating the right-angle grids, a large number of geometric Boolean operations are required in the three steps of octree generation, grid cutting judgment and inner surface grid point projection, most of grid generation time is occupied, relevant calculation examples show that the three parts account for 90-95% of the total grid generation time, and the geometric Boolean operations of the three parts can be finally converted into intersection operations of basic geometric structures:
(1) When the octree grid is generated, an encryption unit needs to be judged, the encryption is carried out when the distance from a cube unit to an object plane is smaller than a specified value according to the encryption basis, the problem that a sphere with the center of the grid unit as the center of a circle and the specified value as the radius intersects with a background grid can be solved, and if no intersection point exists, the unit does not need to be encrypted;
(2) When the grid is cut, whether the grid unit is intersected with the background grid needs to be judged, which is a typical intersection problem of a cube and the background grid;
(3) When the inner surface grid points are projected, the distances from the grid points on the inner surface to the triangular/quadrangular units of the background grid need to be calculated, the minimum value is taken as a projection point, and the calculation amount of single projection is equivalent to that of single intersection calculation.
When the complexity analysis is performed on the algorithm, details of calculation such as intersection and projection can be considered as primary basic operation without expanding. The following problems arise: a rectangular grid of M grid cells is generated based on a background grid having N grid cells, where the number of inner grid points is N. The process requires about M × N encryption judgment, M × N cutting judgment and M × N projection, which is equivalent to M × N (2n + N) basic intersection operations. When the generated grid quantity N and the inner face grid N are constant, the grid generation overall calculation quantity (time consumption) is in a linear relation with the background grid unit quantity M.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: aiming at the defects of the prior art, the method for accelerating the generation of the unstructured rectangular grid is provided, the defects of low grid generation speed, low efficiency and the like caused by a large number of geometrical Boolean operations in the steps of cross-tree division, judgment cutting, object plane projection and the like in the conventional unstructured rectangular grid generation process are overcome, the efficiency of the geometrical Boolean operation process is improved through the modes of background grid partitioning and preprocessing, the grid generation is accelerated, and the finally generated computational grid can be prevented from being influenced by partitioning.
The technical solution of the invention is as follows:
an unstructured rectangular grid accelerated generation method comprises the following steps:
1) Describing the shape of an object in a flow field by using commercial meshing software, generating a surface structure mesh or a non-structure mesh, and taking the generated surface structure mesh or the surface non-structure mesh as a background mesh;
2) Setting the number n of partitions according to the number of grids of the background grid, and performing partition processing on the background grid obtained in the step 1) to obtain the background grid after partition processing; taking each partition as a plate Bi, wherein each plate comprises a plurality of grid units; the number n of the subareas is less than the number of the grid units in each plate, and n is a positive integer;
3) Setting grid generation parameters, determining a flow field area to be divided, and obtaining an initial grid; the initial grid is rectangular, the cuboid surrounds the background grid in the step 1), and each grid unit in the initial grid is a cuboid with the same size;
4) Dividing the initial grid in the step 3) according to the background grid after the partition in the step 2) and the grid generation parameters in the step 3) to generate a flow field grid, wherein the type of the flow field grid is a cross-tree structure;
5) Deleting grid units positioned inside the surface of the object and grid units intersected with the surface of the object in the flow field grid according to the position relation between the grid units and the surface of the object in the flow field grid to obtain a sawtooth-shaped inner surface of the flow field grid;
6) Smoothing the sawtooth-shaped inner surface of the flow field grid in the step 5) to obtain a smooth inner surface of the flow field grid;
7) Projecting the smooth inner surface of the flow field grid in the step 6) to obtain a viscous layer grid corresponding to the flow field grid;
8) Calculating the background grids after the partition processing in the step 2), the flow field grids in the step 4) and the viscous layer grids in the step 7), generating grid quantity and outputting grid information.
The method for generating the flow field grid in the step 4) specifically comprises the following steps:
41 Randomly selecting one grid unit from the initial grid in the step 3) as a judgment object A, obtaining all plates meeting the distance condition according to the position relation between the center of the grid unit of the judgment object A and each plate, and judging that the plate meets the distance condition if the distance between the center of the grid unit of the judgment object A and the plate is less than 5-9 times of the side length of the longest edge of the grid unit of the judgment object A;
42 Selecting a plate Bi with the minimum distance from the judgment object A from all plates meeting the distance condition, and determining the intersection relation between the judgment object A and the plate Bi according to the intersection relation and the distance between all grid unit nodes in the plate Bi and the judgment object A; if only one grid unit intersected with the judgment object A exists in the plate Bi, judging that the plate Bi is intersected with the judgment object A;
43 Repeating the steps 41) to 42), traversing all grid units in the initial grid, and finding out all grid units intersected with the plate in the initial grid as intersected units;
44 Performing cross-tree division on the intersected units, and performing cross-tree division on grid units adjacent to the intersected units to finish primary encryption to obtain initial grids finished with grid encryption;
45 ) randomly selecting a grid unit from the initial grid subjected to grid encryption in the step 44) as a judgment object A, and repeating the steps 41) to 44) N times to obtain a flow field grid; n is a positive integer, and N is more than 3.
The method for obtaining the viscous layer grid corresponding to the flow field grid in the step 7) specifically comprises the following steps:
71 ) taking any grid unit node C on the smooth inner surface of the flow field grid obtained in the step 6) j Determining and gridding cell node C j Nearest plate B j ；
72 Repeating the step 71) to traverse all grid unit nodes on the smooth inner surface of the flow field grid to obtain a plate B corresponding to each node j (ii) a The plate B j Upper and corresponding grid cell node C j The nearest point is used as a grid unit node C j Determining the projection points of all grid unit nodes in the fairing inner surface of the flow field grid;
73 Smoothing each grid unit node C in the inner surface of the flow field grid j Sequentially connecting with the corresponding projection points, and taking the space between the background grid and the smooth inner surface of the flow field grid as a gap layer; dividing the gap layer into cylindrical grids, and pointing the cylindrical grids from projection points to the smooth inner surface of the flow field grid to correspond to grid unit nodes B j And (4) carrying out multilayer division to obtain viscous layer grids corresponding to the flow field grids.
Compared with the prior art, the invention has the following advantages:
1) When the tree structure division and the cutting unit judgment are carried out, only a few object plane sub-region grid points meeting the conditions are searched for the distance calculation between the grid unit and the object plane, and the calculation amount is greatly reduced compared with the commonly adopted global search;
2) When the viscous layer grid is generated, the inner surface grid only needs to search and project in the corresponding area, and compared with the commonly adopted global projection, the projection efficiency can be greatly improved;
drawings
FIG. 1 illustrates an octree grid generation approach;
FIG. 2 is a schematic of a partition partitioning process;
FIG. 3a is an input background grid;
FIG. 3b is a sectional illustration after rough sectioning;
FIG. 3c is the restored partitioned grid;
FIG. 4 is a flow chart of the present invention.
Detailed Description
The invention discloses an unstructured rectangular grid accelerated generation method, which is shown in figure 4 and comprises the following steps:
1) Describing the shape of an object in a flow field by using commercial meshing software such as Pointwise, ICEM and the like to generate a surface structure mesh or a non-structure mesh, and taking the generated surface structure mesh or the surface non-structure mesh as a background mesh;
2) Setting the number n of partitions according to the number of grids of the background grid, and performing partition processing on the background grid obtained in the step 1) to obtain the background grid after partition processing; each partition is used as a plate Bi, and each plate comprises a plurality of grid units; the number n of the subareas is less than the number of the grid units in each plate, and n is a positive integer; the partition process is shown in FIG. 2;
3) Setting grid generation parameters, determining a flow field area to be divided, and obtaining an initial grid; the shape of the initial grid is rectangular, the cuboid surrounds the shape of the background grid in the step 1), the cuboid is equally divided in three directions of an x axis, a y axis and a z axis according to values set by the generation parameters, and the initial grid, the x axis, the y axis and the z axis form a rectangular coordinate system. Each grid unit in the initial grid is a cuboid with the same size;
4) Dividing the initial grid in the step 3) according to the background grid after the partition in the step 2) and the grid generation parameters in the step 3) to generate a flow field grid, wherein the type of the flow field grid is a cross-tree structure;
5) Deleting grid units positioned inside the surface of the object and grid units intersected with the surface of the object in the flow field grid according to the position relation between the grid units and the surface of the object in the flow field grid to obtain a sawtooth-shaped inner surface of the flow field grid;
6) Smoothing the sawtooth-shaped inner surface of the flow field grid in the step 5) to obtain a smooth inner surface of the flow field grid;
7) Projecting the smooth inner surface of the flow field grid in the step 6) to obtain a viscous layer grid corresponding to the flow field grid;
8) Calculating the background grids after the partition processing in the step 2), the flow field grids in the step 4) and the viscous layer grids in the step 7), generating grid quantity and outputting grid information.
Step 2) the method for processing the background grids in a partition mode specifically comprises the following steps:
selecting a plurality of grid nodes which are specifically associated (one end of each grid node has a common node) from the object shape background grids and merging the grid nodes into one node, and obtaining a coarse background grid after merging each time until the grid scale meets the partition parameter setting requirement; performing initial partitioning to make the number of nodes or node weights (weights are generally determined by the number of shared nodes) contained in each region substantially equal, and simultaneously ensuring that cut edges are minimum (namely edges of nodes at two ends divided into different sub-regions are called cut edges); and mapping the partitioned coarse background grids back to the original grids along the coarse path, and performing fine adjustment in the mapping process to ensure the grid quality.
The method for generating the flow field grid in the step 4) specifically comprises the following steps:
41 Randomly selecting one grid unit from the initial grids in the step 3) as a judgment object A, obtaining all plates meeting distance conditions according to the position relation between the center of the grid unit of the judgment object A and each plate B1-Bn, setting the distance in actual division to be 5-9 times of the side length of the longest edge of the grid unit of the judgment object A, and determining the specific value according to the encryption requirements of grid generation in different problems; if the distance between the center of the grid unit of the judgment object A and the plate is less than 5-9 times of the side length of the longest edge of the grid unit of the judgment object A, judging that the plate meets the distance condition;
42 Selects the plate Bi with the minimum distance from the judgment object A from all the plates meeting the distance condition, and determines the intersection relation between the judgment object A and the plate Bi according to the intersection relation and the distance between all grid unit nodes in the plate Bi and the judgment object A; if only one grid unit intersected with the judgment object A exists in the plate Bi, judging that the plate Bi is intersected with the judgment object A;
43 Repeating the steps 41) to 42), traversing all grid units in the initial grid, and finding out all grid units intersected with the plate in the initial grid as intersected units;
44 Performing cross-tree division on the intersected units, and performing cross-tree division on grid units adjacent to the intersected units to finish primary encryption to obtain initial grids finished with grid encryption;
45 Randomly selecting a grid unit from the initial grid subjected to the grid encryption in the step 44) as a judgment object A, repeating the steps 41) to 44) for N times, and repeating the operation same as the first encryption for N times to obtain a flow field grid; n is a positive integer, the encryption times N are determined according to the generation parameters set in the step 3), and in order to ensure the calculation precision of subsequent numerical values, the encryption times N are generally more than 3.
Step 7) the method for projecting the smooth rear inner surface and obtaining the viscous layer grid corresponding to the flow field grid specifically comprises the following steps:
71 ) taking any grid unit node C on the smooth inner surface of the flow field grid obtained in the step 6) j Determining and grid cell node C j Nearest plate B j ；
72 Repeating the step 71) to traverse all grid unit nodes on the smooth inner surface of the flow field grid to obtain a plate B corresponding to each node j (ii) a The plate B j Upper and corresponding grid cell node C j The nearest point is used as a grid unit node C j The projection points of all grid unit nodes on the smooth inner surface of the flow field grid are sequentially determined in the same way;
73 Smoothing each grid unit node C in the flow field grid j Sequentially connecting with corresponding projection points, and taking the space between the background grid and the smooth inner surface of the flow field grid as a gap layer; dividing the gap layer into cylindrical grids, and pointing the cylindrical grids from projection points to the smooth inner surface of the flow field grid to correspond to grid unit nodes B j And (4) carrying out multilayer division to obtain viscous layer grids corresponding to the flow field grids.
When the cross-tree grids are generated, the number of searched plates is greatly reduced compared with that before the partition when the distance between the center of a certain grid unit or the grid point in the space and the background grid is judged, and the number of the grid units required to be traversed is reduced. Similarly, the projection process is simplified, and the generation of the unstructured rectangular grid is accelerated.
Examples
Step 1: describing object shape to generate background grid
First, a background grid of objects is provided, i.e. the original object is represented as a collection of many small background grid surfaces, as shown in fig. 3a, which is a schematic diagram of the background grid of the flat plate shape. The background mesh can be a triangle, a quadrangle or any other polygon, and the mesh is only the shape input file, i.e. the shape of the object that tells the program to describe.
Step 2: partitioning a background grid
(1) Selecting a plurality of grid nodes which are specifically associated from the object-shaped background grids and combining the grid nodes into a node, and obtaining a coarse-level background grid after each combination until the grid scale meets the requirement, as shown in fig. 3a and 3b;
(2) Performing initial partitioning, so that the number of nodes or the weight of the nodes contained in each region is substantially equal, and meanwhile, the cut edge is minimum (that is, the edges of the nodes at the two ends divided into different sub-regions are called cut edges, fig. 3b;
(3) The partitioned coarsely-divided background grid is mapped back to the original grid along the coarsely-divided path, and fine adjustment is performed in the mapping process to ensure the grid quality, as shown in fig. 3 c.
And 3, step 3: setting mesh generation parameters
And (3) inputting various parameters generated by the grids according to the requirement of numerical calculation, such as the size of a calculation domain, the size of the first-layer grid, the number of grid encryption layers and the like, and inputting files such as the object-shaped background grid obtained in the step (2) and the like.
And 4, step 4: generating a cross tree structure according to the background grids and the setting parameters after partitioning
According to the input object shape background grid and all setting parameters, firstly dividing a calculation domain into initial grids, carrying out geometric Boolean operation on initial grid cells and the background grid, and then carrying out cross-tree encryption on cells closer to object shapes in the grids to generate cross-tree structure grids meeting the setting conditions;
and 5: deleting the units within and intersecting the object to produce a saw-tooth inner surface
Step 6: smoothing the sawtooth-shaped inner surface to obtain a smoothed inner surface
Firstly, the cells in the object plane and intersecting with the object plane are deleted, a certain gap exists between the grids and the object plane, and the grid plane (referred to as an inner plane in the text) adjacent to the gap layer is zigzag. In the process of generating the unstructured right-angle grid adhesive layer, smoothing is carried out on the inner surface firstly;
step 7: projecting the smooth rear inner surface
(1) Firstly, analyzing an input object shape background grid, finding out discontinuous positions of spatial coordinate derivatives on object shapes, and extracting intersecting lines;
(2) Reversely projecting the intersecting line on the object shape to the inner surface to obtain a projection line of the intersecting line on the inner surface;
(3) Projecting each grid point on the inner surface to a corresponding area on the object shape;
(4) After the projection is finished, obtaining a projection layer grid, and carrying out layered encryption on the projection layer grid according to set parameters to obtain a viscous layer grid;
and 8: calculating grid quantity and outputting grid information
And outputting the grid information. And outputting parameters required in numerical calculation, such as the area of each unit surface in the grid, the volume of each unit body, the coordinates of each grid point in the grid and the like.
The invention is not described in detail and is within the knowledge of a person skilled in the art.
Claims (3)
1. An unstructured rectangular grid accelerated generation method is characterized by comprising the following steps:
1) Describing the shape of an object in a flow field by using commercial meshing software, generating a surface structure mesh or a non-structure mesh, and taking the generated surface structure mesh or the surface non-structure mesh as a background mesh;
2) Setting the number n of partitions according to the number of grids of the background grid, and performing partition processing on the background grid obtained in the step 1) to obtain the background grid after partition processing; each partition is used as a plate Bi, and each plate comprises a plurality of grid units; the number n of the subareas is less than the number of the grid units in each plate, and n is a positive integer;
3) Setting grid generation parameters, determining a flow field area to be divided, and obtaining an initial grid; the initial grid is rectangular, the cuboid surrounds the background grid in the step 1), and each grid unit in the initial grid is a cuboid with the same size;
4) Dividing the initial grid in the step 3) according to the background grid after the partition in the step 2) and the grid generation parameters in the step 3) to generate a flow field grid, wherein the type of the flow field grid is a cross-tree structure;
5) Deleting grid units positioned inside the object surface and grid units intersected with the object surface in the flow field grid according to the position relation between the grid units and the object surface in the flow field grid to obtain a zigzag inner surface of the flow field grid;
6) Smoothing the sawtooth-shaped inner surface of the flow field grid in the step 5) to obtain a smooth inner surface of the flow field grid;
7) Projecting the smooth inner surface of the flow field grid in the step 6) to obtain a viscous layer grid corresponding to the flow field grid;
8) Calculating the background grids after the partition processing in the step 2), the flow field grids in the step 4) and the viscous layer grids in the step 7), generating grid quantity and outputting grid information.
2. An unstructured rectangular grid accelerated generation method as defined in claim 1, wherein: the method for generating the flow field grid in the step 4) specifically comprises the following steps:
41 Randomly selecting one grid unit from the initial grid in the step 3) as a judgment object A, obtaining all plates meeting the distance condition according to the position relation between the center of the grid unit of the judgment object A and each plate, and judging that the plate meets the distance condition if the distance between the center of the grid unit of the judgment object A and the plate is less than 5-9 times of the side length of the longest edge of the grid unit of the judgment object A;
42 Selects the plate Bi with the minimum distance from the judgment object A from all the plates meeting the distance condition, and determines the intersection relation between the judgment object A and the plate Bi according to the intersection relation and the distance between all grid unit nodes in the plate Bi and the judgment object A; if only one grid unit intersected with the judgment object A exists in the plate Bi, judging that the plate Bi is intersected with the judgment object A;
43 Repeating the steps 41) to 42), traversing all grid units in the initial grid, and finding out all grid units intersected with the plate in the initial grid as intersected units;
44 Performing cross-tree division on the intersecting units, and performing cross-tree division on grid units adjacent to the intersecting units to finish first encryption to obtain initial grids for finishing grid encryption;
45 ) randomly selecting a grid unit from the initial grid subjected to grid encryption in the step 44) as a judgment object A, and repeating the steps 41) to 44) N times to obtain a flow field grid; n is a positive integer, and N is more than 3.
3. An accelerated unstructured rectangular grid generation method as defined in any one of claims 1-2, further comprising: step 7) the method for obtaining the viscous layer grid corresponding to the flow field grid specifically comprises the following steps:
71 ) taking any grid unit node C on the smooth inner surface of the flow field grid obtained in the step 6) j Determining and gridding cell node C j Nearest plate B j ；
72 Repeating the step 71) to traverse all grid unit nodes on the smooth inner surface of the flow field grid to obtain a plate B corresponding to each node j (ii) a The plate B j Upper and corresponding grid cell node C j The closest point is used as a grid unit node C j Projection ofDetermining projection points of all grid unit nodes on the smooth inner surface of the flow field grid;
73 Smoothing each grid unit node C in the inner surface of the flow field grid j Sequentially connecting with corresponding projection points, and taking the space between the background grid and the smooth inner surface of the flow field grid as a gap layer; dividing the gap layer into cylindrical grids, and pointing the cylindrical grids from projection points to the smooth inner surface of the flow field grid to correspond to grid unit nodes B j And (3) carrying out multi-layer division to obtain viscous layer grids corresponding to the flow field grids.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010172253.2A CN111400969B (en) | 2020-03-12 | 2020-03-12 | Method for accelerating generation of unstructured right-angle grid |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010172253.2A CN111400969B (en) | 2020-03-12 | 2020-03-12 | Method for accelerating generation of unstructured right-angle grid |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111400969A CN111400969A (en) | 2020-07-10 |
| CN111400969B true CN111400969B (en) | 2022-10-28 |
Family
ID=71432363
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010172253.2A Active CN111400969B (en) | 2020-03-12 | 2020-03-12 | Method for accelerating generation of unstructured right-angle grid |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111400969B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114282381A (en) * | 2021-12-28 | 2022-04-05 | 中国航天空气动力技术研究院 | Method and system for automatically generating non-uniform right-angle grid |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102930589A (en) * | 2012-09-29 | 2013-02-13 | 中国航天空气动力技术研究院 | Method for correcting intersecting line of unstructured Cartesian grid |
| CN104732589A (en) * | 2015-04-14 | 2015-06-24 | 中国航天空气动力技术研究院 | Rapid generation method of hybrid grid |
| CN107403466A (en) * | 2017-08-03 | 2017-11-28 | 中国空气动力研究与发展中心计算空气动力研究所 | Ultra-large unstrctured grid generation method based on overall situation encryption |
| CN110334450A (en) * | 2019-07-09 | 2019-10-15 | 中国空气动力研究与发展中心计算空气动力研究所 | A kind of multi-blocked structure grid generate in object plane erroneous projection restorative procedure |
-
2020
- 2020-03-12 CN CN202010172253.2A patent/CN111400969B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102930589A (en) * | 2012-09-29 | 2013-02-13 | 中国航天空气动力技术研究院 | Method for correcting intersecting line of unstructured Cartesian grid |
| CN104732589A (en) * | 2015-04-14 | 2015-06-24 | 中国航天空气动力技术研究院 | Rapid generation method of hybrid grid |
| CN107403466A (en) * | 2017-08-03 | 2017-11-28 | 中国空气动力研究与发展中心计算空气动力研究所 | Ultra-large unstrctured grid generation method based on overall situation encryption |
| CN110334450A (en) * | 2019-07-09 | 2019-10-15 | 中国空气动力研究与发展中心计算空气动力研究所 | A kind of multi-blocked structure grid generate in object plane erroneous projection restorative procedure |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111400969A (en) | 2020-07-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Minetto et al. | An optimal algorithm for 3D triangle mesh slicing | |
| Zhang et al. | An improved slicing algorithm with efficient contour construction using STL files | |
| JP4381743B2 (en) | Method and program for generating volume data from boundary representation data | |
| EP1021798B1 (en) | Longest-edge refinement and derefinement system and method for automatic mesh generation | |
| CN102306396B (en) | Three-dimensional entity model surface finite element mesh automatic generation method | |
| CN106934826B (en) | Rock slope structure refined modeling and block identification method | |
| CN107622530B (en) | Efficient and robust triangulation network cutting method | |
| CN104966317A (en) | Automatic three-dimensional modeling method based on contour line of ore body | |
| KR20130049753A (en) | Designing a modeled volume represented by dexels | |
| US11953879B2 (en) | Agent-based slicing for 3D object models | |
| Zhao et al. | STEP-NC feature-oriented high-efficient CNC machining simulation | |
| CN111400969B (en) | Method for accelerating generation of unstructured right-angle grid | |
| US20040138853A1 (en) | Numerical analysis system using hybrid grid adaptation method | |
| CN115758938A (en) | Boundary layer grid generation method for viscous boundary flow field numerical simulation | |
| Freitas et al. | A distributed-memory parallel technique for two-dimensional mesh generation for arbitrary domains | |
| Shen et al. | A framework from point clouds to workpieces | |
| Kukreja et al. | An efficient iso-scallop toolpath planning strategy using voxel-based computer aided design model | |
| de Berg et al. | Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model | |
| CN112819108B (en) | Slice fusion method and system of multi-source heterogeneous model and storage medium | |
| CN114742852A (en) | Efficient free-form surface layering method based on grid intersection and application thereof | |
| JPH04679A (en) | Method and device for supporting coordinate grid preparation | |
| Zhang et al. | Machining Simulation Application Based on Improved Marching Cubes Algorithm | |
| Ye et al. | Information reuse to accelerate customized product slicing for additive manufacturing | |
| Zhao et al. | Geometry-adaptive generation algorithm and boundary match method for initial hexahedral element mesh | |
| CN110796729B (en) | Grid division method based on binary tree |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |