An improved hexahedral mesh matching algorithm

Jinming Chen

doi:10.1007/s00366-015-0414-1

Return

An improved hexahedral mesh matching algorithm

2015-09-07

PRE

Jinming Chen

朱华 (Hua Zhu)

DOI：10.1007/s00366-015-0414-1

Original

Original request for help

Save

Abstract

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.

Keywords:

Mesh matching

Sheet operation

Hexahedral mesh

Finite method analysis

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.