An efficient Advancing Layer Method(ALM)is presented to create semi-structured prisms on viscous walls,in which a procedure that checks possible front intersections is essential to its efficiency.This paper develops v...An efficient Advancing Layer Method(ALM)is presented to create semi-structured prisms on viscous walls,in which a procedure that checks possible front intersections is essential to its efficiency.This paper develops various novel schemes to improve the algorithm’s efficiency precisely while not sacrificing its robustness and the resulting mesh quality.First,it employs a set of new techniques,and data structures are developed to improve the efficiency of the frontcheck procedure.Then,within each octant,a new filter is developed to reduce the intersection computations in the searching process.In addition,data structures are well designed to store the contiguously accessed data in each computing-intensive loop in a contiguous space for a potentially better cache hit ratio.We built a geometry model library formed by examples of industrial complexity to demonstrate the practicability of the algorithm.All the efforts mentioned above enable us to reduce the percentage of computing time taken by intersection check to an acceptable level(approximately 26%),which make it no longer be the most time-consuming part.展开更多
基金co-supported by the Zhejiang Provincial Science and Technology Program,China(No.2021C01108)the Innovative Research Foundation of Ship General Performance,China(No.14022105)the Science and Technology on Scramjet Laboratory Fund,China(No.2022-JCJQ-LB020-05).
文摘An efficient Advancing Layer Method(ALM)is presented to create semi-structured prisms on viscous walls,in which a procedure that checks possible front intersections is essential to its efficiency.This paper develops various novel schemes to improve the algorithm’s efficiency precisely while not sacrificing its robustness and the resulting mesh quality.First,it employs a set of new techniques,and data structures are developed to improve the efficiency of the frontcheck procedure.Then,within each octant,a new filter is developed to reduce the intersection computations in the searching process.In addition,data structures are well designed to store the contiguously accessed data in each computing-intensive loop in a contiguous space for a potentially better cache hit ratio.We built a geometry model library formed by examples of industrial complexity to demonstrate the practicability of the algorithm.All the efforts mentioned above enable us to reduce the percentage of computing time taken by intersection check to an acceptable level(approximately 26%),which make it no longer be the most time-consuming part.
