.png){kind=icon}
返回
An improved hexahedral mesh matching algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s00366-015-0414-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Mesh matching is an effective way to convert the non-conforming interfaces between two hexahedral meshes into conforming ones, which is very important for achieving high-quality finite element analysis. However, the existing mesh matching algorithm is neither efficient nor effective enough to handle complex interfaces and self-intersecting sheets. In this paper, the algorithm is improved in three aspects: (1) by introducing a more precise criteria for chord matching and the concept of partition chord set, complex interfaces with internal loops can be handled more effectively; (2) by proposing a new solution, self-intersecting sheet can be inflated and extracted locally; and (3) by putting forward a mesh quality evaluation method, the sheet extraction operation during mesh matching can be done more efficiently. Our improved mesh matching algorithm is fully automatic, and its effectiveness is demonstrated by several examples in different matching situations.
Keyword:
Mesh matching
Sheet operation
Hexahedral mesh
Finite method analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
2.6K
被引数:
9.3K
机构
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容