Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing

Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing

Year:    2017

Communications in Computational Physics, Vol. 21 (2017), Iss. 5 : pp. 1282–1309

Abstract

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.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/cicp.OA-2016-0085

Communications in Computational Physics, Vol. 21 (2017), Iss. 5 : pp. 1282–1309

Published online:    2017-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    28

Keywords: