A quality-improved fully decoupled parallel tetrahedron generation algorithm

Purpose With the development of high-performance computers, the requirements of numerical simulations on the large scale of girds are increasing. However, the quality of ultra-large-scale grids is difficult to meet the demand. Design/methodology/approach This study proposes an improved high-quality parallel tetrahedral generation algorithm. Key methodological steps include: (1) Employing an enhanced dual graph weight-based domain decomposition method to optimize interface elements, ensure rapid partitioning, and prevent bad cell exposure at interfaces. (2) Developing the extendable node numbering method (ExNN) to achieve fully decoupled parallelization of curve, surface, and solid meshes, enabling boundary updates/partition merging with near-linear time complexity and zero communication overhead, and flexible load balancing in curve/surface parallel processes. (3) Advancing surface projection via parametric coordinates in recursion to ensure efficiency and avoid cell flipping. Findings The algorithm enhances the mesh quality of the partitioned interface and the generation efficiency of massively parallel tetrahedral meshes. With the improved decoupling of the parallel algorithm, an engineering verification of meshing complex geometric models with more than 1 billion elements in 2 minutes on a 1000-core high-performance computer is passed, demonstrating that the method possesses good parallel efficiency and scalability. Originality/value This work contributes critical innovations to large-scale parallel mesh generation: (1) The ExNN method achieves fully decoupled parallelization of curve, surface, and solid meshes, resolving high communication overhead and complexity. (2) The dual graph weight-based decomposition balances interface optimization and partitioning speed, while parametric coordinate projection ensures efficiency and cell stability. (3) ExNN-based fast partition merging (without template restrictions) preserves freedom for parallel refinement.

Authors

Institutions

Publication Details

Journal
Engineering Computations
Published
2025-11-06
DOI
https://doi.org/10.1108/ec-09-2023-0626
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A quality-improved fully decoupled parallel tetrahedron generation algorithm

Fei Yu, Zhonghai Gao, Chengpeng Song, Julin Shan et al.
Engineering Computations
Computational Geometry and Mesh Generation
article

A quality-improved fully decoupled parallel tetrahedron generation algorithm

Fei Yu, Zhonghai Gao, Chengpeng Song, Julin Shan, Guozhong Zhao, Yingjian Fu, Zhenqun Guan, Jihai Chang
article en

Abstract

Purpose With the development of high-performance computers, the requirements of numerical simulations on the large scale of girds are increasing. However, the quality of ultra-large-scale grids is difficult to meet the demand. Design/methodology/approach This study proposes an improved high-quality parallel tetrahedral generation algorithm. Key methodological steps include: (1) Employing an enhanced dual graph weight-based domain decomposition method to optimize interface elements, ensure rapid partitioning, and prevent bad cell exposure at interfaces. (2) Developing the extendable node numbering method (ExNN) to achieve fully decoupled parallelization of curve, surface, and solid meshes, enabling boundary updates/partition merging with near-linear time complexity and zero communication overhead, and flexible load balancing in curve/surface parallel processes. (3) Advancing surface projection via parametric coordinates in recursion to ensure efficiency and avoid cell flipping. Findings The algorithm enhances the mesh quality of the partitioned interface and the generation efficiency of massively parallel tetrahedral meshes. With the improved decoupling of the parallel algorithm, an engineering verification of meshing complex geometric models with more than 1 billion elements in 2 minutes on a 1000-core high-performance computer is passed, demonstrating that the method possesses good parallel efficiency and scalability. Originality/value This work contributes critical innovations to large-scale parallel mesh generation: (1) The ExNN method achieves fully decoupled parallelization of curve, surface, and solid meshes, resolving high communication overhead and complexity. (2) The dual graph weight-based decomposition balances interface optimization and partitioning speed, while parametric coordinate projection ensures efficiency and cell stability. (3) ExNN-based fast partition merging (without template restrictions) preserves freedom for parallel refinement.

Engineering Computations
Xidian University (CN), Dalian University of Technology (CN), Education University of Hong Kong (HK), Dalian University (CN), Quantum Technologies (Sweden) (SE)
Openalex Percentile: Top 44%
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.