Self-Organizing Hybrid Cartesian Grid Generation and Solutions for Arbitrary Geometries

2001 ◽  
pp. 19-33
Author(s):  
F. Deister ◽  
D. Rocher ◽  
E. H. Hirschel ◽  
F. Monnoyer
1998 ◽  
pp. 25-49 ◽  
Author(s):  
F. Deister ◽  
D. Rocher ◽  
E. H. Hirschel ◽  
F. Monnoyer

2008 ◽  
Vol 73 (624) ◽  
pp. 207-214
Author(s):  
Masashi IMANO ◽  
Naoki OHNISHI ◽  
Motoyasu KAMATA ◽  
Yuzo SAKAMOTO

2014 ◽  
Vol 57 (3) ◽  
pp. 630-636 ◽  
Author(s):  
Qiang Qin ◽  
ChangZhen Hu ◽  
TianBao Ma

2021 ◽  
Author(s):  
Xueliang Li ◽  
Lin Bi ◽  
Shuang Meng ◽  
Hongkang Liu ◽  
Tiantian Wang ◽  
...  

Abstract The relationship between the spatial cell and the object is unknown for the Cartesian grid using the immersed boundary method. For the researches about complex geometry or multi-body relative motion, grid generation is a very time-consuming work, and the consumption is mainly concentrated in the position determination of the Cartesian cells, which we called the cell type determination. In this study, based on the axis-aligned bounding box method and the ray casting method, we employed the dot product method and the painting algorithm to investigate the acceleration method for Cartesian grid generation. The octree structure is used to store the Cartesian cells, and the k-dimensional tree is used to store the object surface. These data management strategy can minimize the CPU’s resource while have a small memory usage. The grid generation results show that the strategy we proposed has a high efficiency and well robustness, and the time consume can reduce more than 50% compare with the original method. When dealing with a enough complex problem, the time consume can even reaches several orders of magnitude difference compared with the original method.


Sign in / Sign up

Export Citation Format

Share Document