.png){kind=icon}
.png){kind=icon}
Return
An improved local remeshing algorithm for moving boundary problems
.png){kind=icon}
OA
AI
DOI：10.1080/19942060.2016.1174888.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Three issues are tackled in this study to improve the robustness of local remeshing techniques. Firstly, the local remeshing region (hereafter referred to as 'hole') is initialized by removing low-quality elements and then continuously expanded until a certain element quality is reached after remeshing. The effect of the number of the expansion cycle on the hole size and element quality after remeshing is experimentally analyzed. Secondly, the grid sources for element size control are attached to moving bodies and will move along with their host bodies to ensure reasonable grid resolution inside the hole. Thirdly, the boundary recovery procedure of a Delaunay grid generation approach is enhanced by a new grid topology transformation technique (namely shell transformation) so that the new grid created inside the hole is therefore free of elements of extremely deformed/skewed shape, whilst also respecting the hole boundary. The proposed local remeshing algorithm has been integrated with an in-house unstructured grid-based simulation system for solving moving boundary problems. The robustness and accuracy of the developed local remeshing technique are successfully demonstrated via industry-scale applications for complex flow simulations.
Keywords:
Unstructured grid generation
local remeshing technique
boundary recovery
unsteady flow simulation
moving boundary problems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.4
Papers:
1.4K
Citations:
3.9K