@Article{CiCP-21-5,
author = {},
title = {Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing},
journal = {Communications in Computational Physics},
year = {2017},
volume = {21},
number = {5},
pages = {1282--1309},
abstract = {<p style="text-align: justify;">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.</p>},
issn = {1991-7120},
doi = {https://doi.org/10.4208/cicp.OA-2016-0085},
url = {https://global-sci.com/article/80119/delaunay-graph-based-inverse-distance-weighting-for-fast-dynamic-meshing}
}