Adaptive layered Cartesian cut cell method is presented to solve the difficulty of the tmstructured hexahedral anisotropic Cartesian grids generation from the complex CAD model. ＂Vertex merging algorithm based on rel...Adaptive layered Cartesian cut cell method is presented to solve the difficulty of the tmstructured hexahedral anisotropic Cartesian grids generation from the complex CAD model. ＂Vertex merging algorithm based on relaxed AVL tree is investigated to construct topological structure for stereo lithography （STL） files, and a topology-based self-adaptive layered slicing algorithm with special features control strategy is brought forward. With the help of convex hull, a new points-in-polygon method is employed to improve the Cartesian cut cell method. By integrating the self-adaptive layered slicing algorithm and the improved Cartesian cut cell method, the adaptive layered Cartesian cut cell method gains the volume data of the complex CAD model in STL file and generates the unstructured hexahedral anisotropic Cartesian grids.展开更多
基金This project is supported by National Natural Science Foundation of China (No. 60375020, No. 50305033)Provincial Natural Science Foundation of Zhejiang, China (No. Y105430).
文摘Adaptive layered Cartesian cut cell method is presented to solve the difficulty of the tmstructured hexahedral anisotropic Cartesian grids generation from the complex CAD model. ＂Vertex merging algorithm based on relaxed AVL tree is investigated to construct topological structure for stereo lithography （STL） files, and a topology-based self-adaptive layered slicing algorithm with special features control strategy is brought forward. With the help of convex hull, a new points-in-polygon method is employed to improve the Cartesian cut cell method. By integrating the self-adaptive layered slicing algorithm and the improved Cartesian cut cell method, the adaptive layered Cartesian cut cell method gains the volume data of the complex CAD model in STL file and generates the unstructured hexahedral anisotropic Cartesian grids.
