TY - JOUR T1 - Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing JO - Communications in Computational Physics VL - 5 SP - 1282 EP - 1309 PY - 2018 DA - 2018/04 SN - 21 DO - http://doi.org/10.4208/cicp.OA-2016-0085 UR - https://global-sci.org/intro/article_detail/cicp/11279.html KW - AB -

A novel mesh deformation technique is developed based on the Delaunay graph mapping method and the inverse distance weighting (IDW) interpolation. The algorithm maintains the advantages of the efficiency of Delaunay graph mapping mesh deformation while it also possesses the ability of better controlling the near surface mesh quality. The Delaunay graph is used to divide the mesh domain into a number of sub-domains. On each sub-domain, the inverse distance weighting interpolation is applied, resulting in a similar efficiency as compared to the fast Delaunay graph mapping method. The paper will show how the near-wall mesh quality is controlled and improved by the new method.