运动拼接网格中搜索拼接点对算法研究  

ON SEARCHING COUPLES OF PATCHED-POINTS IN MOVING PATCHED GRID

作　　者：张娟[1] 陆林生[1] 

机构地区：[1]江南计算技术研究所,江苏无锡214083

出　　处：《计算机应用与软件》2010年第6期50-52,共3页Computer Applications and Software

基　　金：国家高科技研究发展计划(2006AA1149)

摘　　要：主要讨论在求解运动拼接网格过程中,对于占用很大时间的拼接点对的搜索问题,提出了时间步记忆搜索算法,并介绍了线性搜索、基于网格的Kd数搜索两种算法。理论分析了三种的算法的利弊及适用范围,并利用样例验证之。试验结果表明:基于网格的Kd数搜索较优,经理论分析由于实现上的不足之处以及样例选择导致时间步记忆搜索试验结果不好,仍需完善。This paper mainly discusses the time-consuming search method for couples of patched-point in progress of solving moving patched grid.A new method is presented,which is the last step-based search.This paper also introduces two other methods： linear search and grid-based Kd tree search.Besides,the advantages and disadvantages as well as the scope of application of the above three methods are theoretically analysed in this paper,all are verified with worked-examples.Experiment results indicate that the grid-based Kd tree is better in search;but the deficiency in implementation and the worked-example selection caused unexpected test results for last step-based search,as derived from theoretical analysis,it still needs to be perfected.

关 键 词：CFD 运动拼接网格 线性搜索 基于网格的Kd树 时间步记忆搜索 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]