Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing. (27th March 2017)

• Record Type: Journal Article
• Authors: Wang, Yibin; Qin, Ning; Zhao, Ning
• Is Part Of: Communications in computational physics. Volume 21:Number 5(2017:May)
• Page Start: 1282
• Page End: 1309
• Publication Date: 2017-03-27
• Subjects: 65D18, -- 68U05, -- 68w99; Dynamic mesh, -- inverse distance weighting, -- Delaunay graph mapping; Mathematical physics -- Data processing -- Periodicals; Physics -- Data processing -- Periodicals; 530.150285
• DOI: 10.4208/cicp.OA-2016-0085
• Languages: English
• ISSNs: 1815-2406

Abstract

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