A distributed-memory parallel technique for two-dimensional mesh generation for arbitrary domains

Freitas, Markos O.; Wawrzynek, Paul A.; Cavalcante-Neto, Joaquim Bento; Vidal, Creto Augusto; Martha, Luiz Fernando; Ingraffea, Anthony R.

doi:10.1016/j.advengsoft.2013.03.005

Cited by 15 publications

(7 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We call the first strategy the extrinsic space partitioning method, because it partitions data by partitioning the data's embedding space. For example, data can be decomposed by spatial subdivision or partitioning structures such as quad-tree or octree [10], axis/planes [3], or blocks [11]. In parallel data processing literature, a very popular extrinsic space partitioning strategy is the space filling curve [12,13].…”

Section: Geometric Region Partitioningmentioning

confidence: 99%

Geometry-aware partitioning of complex domains for parallel quad meshing

Liu

2017

Computer-Aided Design

View full text Add to dashboard Cite

We develop a partitioning algorithm to decompose complex 2D data into small and simple subregions for effective parallel quad meshing. To support effective quad mesh generation, the partitioning reduces to solving an integer quadratic optimization problem with linear constraints. Directly solving this problem is expensive for large-scale data. Hence, we also suggest a more efficient two-step algorithm to obtain an approximate solution. First, we partition the region into a set of cells using L ∞ Centroidal Voronoi Tessellation (CVT), then we solve a graph partitioning on the dual graph of this CVT to minimize the total partitioning boundary length, while enforcing the load balancing and each subregion's connectivity. With this decomposition, subregions arcarslaw1940somee distributed to multiple processors for parallel quadrilateral mesh generation. Through thorough comparisons on the quality of the final meshes and the performance of simulations run on these meshes, we show that our decomposition algorithm outperforms existing partitioning approaches by offering better partitioning, and therefore, more simulation-friendly regular meshes.

show abstract

Section: Geometric Region Partitioningmentioning

confidence: 99%

Geometry-aware partitioning of complex domains for parallel quad meshing

Liu

2017

Computer-Aided Design

View full text Add to dashboard Cite

show abstract

“…In solid mechanics, where the finite element method is most widely used, the quadtree decomposition is an intermediate step that is usually employed in the automatic mesh generation of triangular meshes [8,9] and quadrilateral meshes [10,11]. Mesh generators employing quadtree algorithms are fast, efficient and are capable of achieving rapid and smooth transitions of element sizes between regions of mesh refinement.…”

Section: Introductionmentioning

confidence: 99%

Adaptation of quadtree meshes in the scaled boundary finite element method for crack propagation modelling

Ooi

Man

Natarajan

et al. 2015

Engineering Fracture Mechanics

121

View full text Add to dashboard Cite

A crack propagation modelling technique combining the scaled boundary finite element method and quadtree meshes is developed. This technique automatically satisfies the compatibility requirement between adjacent quadtree cells irrespective of the presence of hanging nodes. The quadtree structure facilitates efficient data storage and rapid computations. Only a single cell is required to accurately model the stress field near crack tips. Crack growth is modelled by splitting the cells in the mesh into two. The resulting polygons are directly modelled by the scaled boundary formulation with minimal changes to the mesh. Four numerical examples demonstrate the salient features of the technique.

show abstract

“…Similarly, Ito et al proposed a parallel unstructured mesh generation by AFT too, in which a coarse tetrahedral mesh rather than Cartesian mesh is used as background grid and is partitioned into subzones using METIS, and then volume mesh is generated on each subzone in parallel using AFT. Freitas and Wawrzynek developed a similar technique to generate two‐dimensional triangles by using a coarse quad‐tree to decompose the domain into subzones and serial AFT to generate elements in each subzone. Lintermann and Schlimpert generated massive hierarchical Cartesian meshes on distributed multicore HPC systems with multiple levels of refinement.…”

Section: Introductionmentioning

confidence: 99%

A large‐scale parallel hybrid grid generation technique for realistic complex geometry

Zhao

Zhang

et al. 2020

Numerical Methods in Fluids

View full text Add to dashboard Cite

Summary High‐Performance Computing (HPC) systems and Computational Fluid Dynamics (CFD) have made significant progress in recent years; however, as the basis of the large‐scale parallel computing, the massive grid generation of billions of cells has become a bottleneck problem. In this study, a parallel grid generation technique is proposed to generate large‐scale mixed grids with arbitrary cell types and scales. The basic idea of our method is analogous to the global mesh refinement technique. An initial coarse grid with arbitrary cell types is regarded as a background mesh which is partitioned into subzones, and subzones are assigned onto different CPU cores. After the cells and faces in each subzone are split, the inserted new points of the solid wall are projected onto the original CAD entities to preserve the geometry accurately. Finally, the tangled cells caused by the projection in the boundary layer are untangled by a local Radial Basis Function mesh deformation technique. Furthermore, a parallel partition approach and an efficient wall distance computing technique for massive grids are developed also to shorten the preprocessing time. The tests show that the preprocessing efficiency has been increased by two or three orders compared with traditional methods. Billions of grids are generated for the AIAA JSM high‐lift model and the Chinese CHN‐T1 transport model to test the ability of the parallel grid generation technique. The maximum scale up to 19 billion mixed elements is generated using 16 384 CPU cores in parallel, and the mesh quality is acceptable for CFD simulations.

show abstract

A distributed-memory parallel technique for two-dimensional mesh generation for arbitrary domains

Cited by 15 publications

References 24 publications

Geometry-aware partitioning of complex domains for parallel quad meshing

Geometry-aware partitioning of complex domains for parallel quad meshing

Adaptation of quadtree meshes in the scaled boundary finite element method for crack propagation modelling

A large‐scale parallel hybrid grid generation technique for realistic complex geometry

Contact Info

Product

Resources

About