Hexahedral Mesh Cutting Using Geometric Model With New Boundaries Well Matched
Hua Zhu, Shuming Gao, Chuhua Xian
Abstract
Hua Zhu, Shuming Gao, Chuhua Xian
Abstract
Hexahedral mesh generation is difficult and time-consuming. To avoid the complicated hexahedral mesh regeneration after each variational design, hexahedral mesh editing can be used. In this paper, an accurate hexahedral mesh cutting approach using geometric model is proposed, and the part of the geometric model inside the mesh model can be complex and arbitrary. In the approach, all the newly added geometric entities resulted from mesh cutting are first generated by performing the subtraction operation between the mesh model and the geometric model. Then, for each newly added geometric element, including point, edge and face, the mesh nodes that need to be moved onto it, are determined and repositioned with the mesh quality considered. To ensure the rationality of mesh nodes determination, for each newly added edge, the mesh nodes are identified using shortest path algorithm. Finally, the mesh elements that should not be in the resultant mesh model are deleted, Pillowing and Smoothing operations are further conducted to improve the mesh quality. Some preliminary results are given to show the feasibility of the approach.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Hexahedral mesh generation is difficult and time-consuming. To avoid the complicated hexahedral mesh regeneration after each variational design, hexahedral mesh editing can be used. In this paper, an accurate hexahedral mesh cutting approach using geometric model is proposed, and the part of the geometric model inside the mesh model can be complex and arbitrary. In the approach, all the newly added geometric entities resulted from mesh cutting are first generated by performing the subtraction operation between the mesh model and the geometric model. Then, for each newly added geometric element, including point, edge and face, the mesh nodes that need to be moved onto it, are determined and repositioned with the mesh quality considered. To ensure the rationality of mesh nodes determination, for each newly added edge, the mesh nodes are identified using shortest path algorithm. Finally, the mesh elements that should not be in the resultant mesh model are deleted, Pillowing and Smoothing operations are further conducted to improve the mesh quality. Some preliminary results are given to show the feasibility of the approach.
Key concepts: Hexahedron, Laplacian smoothing, Mesh generation, T-vertices, Computer science, Triangle mesh, Geometric modeling, Enhanced Data Rates for GSM Evolution