A new dynamic mesh method based on a cluster of background meshes

A novel dynamic grid deformation technique based on a cluster of background meshes is presented in this paper. The cluster of background meshes consists of background meshes which are generated by using any node on the internal boundaries and corner points of the far field boundary. By keeping the relative area coefficients unchanged (volume coordinates unchanged in three dimensions), the desired positions of the internal nodes in every background mesh are solved when the background meshes are moved due to the movement of the nodes on the internal boundaries. The new position of a node can be obtained by taking a weighted average of its desired positions. The weights are related to the reciprocal value of the distances between the node and internal boundary nodes. The cluster of background meshes, which is introduced by the new approach, can overcome the shortcomings of using a complex background mesh. Examples demonstrate that the mesh deformation method based on a cluster of background meshes is easy to realize. In comparison with the spring analogy method, it is more efficient for it is non-iterative, and its mesh deformation capacity is stronger. In comparison with the mesh deformation method based on Delaunay graph mapping, it is easier to locate the internal nodes and background meshes will not have overlap between elements for the structure of background meshes is simple. The method based on a cluster of background meshes has a stronger mesh deformation capacity than the Delaunay graph method, and the quality of the deformed mesh is better.