full
search.png

Search

close.png

Cancel

arrow
Volume 21, Issue 5
Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing

Yibin Wang, Ning Qin & Ning Zhao

DOI: 10.4208/cicp.OA-2016-0085

Commun. Comput. Phys., 21 (2017), pp. 1282-1309.

Published online: 2018-04

Preview Purchase PDF 2499 32630

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{CiCP-21-1282, author = {Yibin Wang, Ning Qin and Ning Zhao}, title = {Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing}, journal = {Communications in Computational Physics}, year = {2018}, volume = {21}, number = {5}, pages = {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.

}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.OA-2016-0085}, url = {http://global-sci.org/intro/article_detail/cicp/11279.html} }
TY - JOUR T1 - Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing AU - Yibin Wang, Ning Qin & Ning Zhao 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.

Yibin Wang, Ning Qin and Ning Zhao. (2018). Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing. Communications in Computational Physics. 21 (5). 1282-1309. doi:10.4208/cicp.OA-2016-0085
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard