A Cartesian-base unstructured grid generation method for moving boundary applications (original) (raw)

A geometric adaptation method is presented for automatic generation of moving boundary unstructured grids. The method has extended the applicability of the existing Cartesian-base unstructured grid generation method to moving boundary applications. The grid generation procedure uses a Cartesian grid approach as a suitable ground for data structure access. In addition, the method requires minimum modification of the grid (and data structure) during the relative motion of the bodies, since the majority of the Cartesian cells are unchanged throughout the moving process. Therefore, less computations and higher accuracy can be achieved due to minimum grid modification and flow variable interpolation. To demonstrate the feasibility of this method, initial computations have been carried out for a store separation case using a cell-centered finite volume inviscid flow solver.