A Bezier-Based Moving Mesh Framework for Simulation with Elastic Membranes

In this paper we present an application of our Bezier-based approach to moving meshes [1] to Navier-Stokes simulations with several immersed elastic membranes. By a moving mesh we mean one that moves with the material and is adapted to maintain good aspect ratio triangles of minimal size. The adaptations we employ include point insertion and removal, as well as edge smoothing. This work is being done as part of the Sangria project [2] whose goal is to develop geometric and numerical algorithms and software for the simulation of blood flow at the microstructural level. In our approach, we adopt the Lagrangian paradigm where domain boundaries and object interfaces move together with the fluid in which they are immersed. This approach has the advantage that boundaries and object interfaces are easy to track. A moving mesh also poses difficult geometric problems since very distorted elements can be created as the simulation evolves. This can lead to several undesirable or catastrophic situations such as inverted or overlapping elements. From the computational geometry perspective, the challenge presented by the Lagrangian paradigm is the ability to maintain a good quality mesh as the simulation evolves in time. We tackle this problem by using non-linear elements and by locally modifying the mesh using a few primitive operations. The use of non-linear elements allows us to represent the mesh with fewer elements in our simulations, and the use of local operators allows us to avoid remeshing the simulation domain at every time step.

[1]  Randall J. LeVeque,et al.  An Immersed Interface Method for Incompressible Navier-Stokes Equations , 2003, SIAM J. Sci. Comput..

[2]  Andrew P. Kuprat,et al.  Moving Adaptive Unstructured 3-D Meshes in Semiconductor Process Modeling Applications , 1998, VLSI Design.

[3]  Timothy J. Baker,et al.  Mesh Movement and Metamorphosis , 2002, Engineering with Computers.

[4]  Xiang-Yang Li,et al.  Simultaneous Refinement and Coarsening: Adaptive Meshing with Moving Boundaries , 1998, IMR.

[5]  G. Farin Curves and Surfaces for Cagd: A Practical Guide , 2001 .

[6]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[7]  Guy E. Blelloch,et al.  A PARALLEL DYNAMIC-MESH LAGRANGIAN METHOD FOR SIMULATION OF FLOWS WITH DYNAMIC INTERFACES , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[8]  Gary L. Miller,et al.  Optimal Coarsening of Unstructured Meshes , 1999, J. Algorithms.

[9]  C. Peskin The immersed boundary method , 2002, Acta Numerica.

[10]  Dafna Talmor,et al.  Well-Spaced Points for Numerical Methods , 1997 .

[11]  Jim Ruppert,et al.  A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.

[12]  Mark S. Shephard,et al.  Automated Adaptive Forming Simulations , 2003, IMR.

[13]  Gary L. Miller,et al.  A bézier-based approach to unstructured moving meshes , 2004, SCG '04.

[14]  J. Gallier Curves and surfaces in geometric modeling: theory and algorithms , 1999 .