.png){kind=icon}
返回
Fine-grained parallel algorithm for unstructured surface mesh generation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compstruc.2015.04.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A parallel surface meshing algorithm is proposed by exploiting the parallelism within the meshing process of a surface, which is more efficient than the conventional scheme that meshes surfaces individually. One integral part is the domain decomposition approach adopted, which ensures no small inter-domain angles; therefore, the parallel meshing procedure can fix the inter-domain boundary without compromising mesh quality. Combining the parallel surface mesher with the parallel tetrahedral mesher and improver developed previously, a parallel preprocessing pipeline for large-scale simulations is set up. It only consumes minutes to prepare a mesh containing hundreds of millions of elements. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Mesh generation
Parallel algorithm
Surface mesh
Domain decomposition
Graph partitioning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.8
论文数:
6.2K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容