A fast mesh deformation method using explicit interpolation

Authors:
Edward Luke;Eric Collins;Eric Blades
Affiliations:
Department of Computer Science and Engineering, Box 9637, Mississippi State University, MS 39762, United States;Center for Advanced Vehicular Systems, Box 9627, Mississippi State University, MS 39762, United States;ATA Engineering, Huntsville Al, United States
Venue:
Journal of Computational Physics
Year:
2012

Citing 6
Cited 1

A fast algorithm for particle simulations

Journal of Computational Physics
Algebraic mesh quality metrics for unstructured initial meshes

Finite Elements in Analysis and Design
Fast dynamic grid deformation based on Delaunay graph mapping

Journal of Computational Physics
Mesh deformation based on radial basis function interpolation

Computers and Structures
Fast Radial Basis Function Interpolation via Preconditioned Krylov Iteration

SIAM Journal on Scientific Computing
Efficient mesh motion using radial basis functions with data reduction algorithms

Journal of Computational Physics

A new mesh deformation method based on disk relaxation algorithm with pre-displacement and post-smoothing

Journal of Computational Physics

Quantified Score

Hi-index	31.45

Visualization

Abstract

A novel mesh deformation algorithm for unstructured polyhedral meshes is developed utilizing a tree-code optimization of a simple direct interpolation method. The algorithm is shown to provide mesh quality that is competitive with radial basis function based methods, with markedly better performance in preserving boundary layer orthogonality in viscous meshes. The parallelization of the algorithm is described, and the algorithm cost is demonstrated to be O(nlogn). The parallel implementation was used to deform meshes of 100 million nodes on nearly 200 processors demonstrating that the method scales to large mesh sizes. Results are provided for a simulation of a high Reynolds number fluid-structure interaction case using this technique.