.png){kind=icon}
返回
Fast harmonic tetrahedral mesh optimization
.png){kind=icon}
OA
AI
DOI：10.1007/s00371-022-02547-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Mesh optimization is essential to enable sufficient element quality for numerical methods such as the finite element method (FEM). Depending on the required accuracy and geometric detail, a mesh with many elements is necessary to resolve small-scale details. Sequential optimization of large meshes often imposes long run times. This is especially an issue for Delaunay-based methods. Recently, the notion of harmonic triangulations [1] was evaluated for tetrahedral meshes, revealing significantly faster run times than competing Delaunay-based methods. A crucial aspect for efficiency and high element quality is boundary treatment. We investigate directional derivatives for boundary treatment and massively parallel GPUs for mesh optimization. Parallel flipping achieves compelling speedups by up to 318x. We accelerate harmonic mesh optimization by 119x for boundary preservation and 78x for moving every boundary vertex, while producing superior mesh quality.
Keyword:
Numerical optimization
GPGPU
Simplicial meshes
Simulation
期刊
IF:
2.9
论文数:
4.6K
被引数:
6.5K
机构
引用论文
Nonlinear vibration of full-filled fluid corrugated sandwich functionally graded cylindrical shells
PREAI
分享收藏
Prediction of damage trajectories in systemic sclerosis using group-based trajectory modelling.png)
Rheumatology
RheumatologyIF0
PREAI
分享收藏分享收藏
查看更多内容