本文選題：重疊網(wǎng)格 + 網(wǎng)格裝配　； 參考：《北京航空航天大學學報》2017年06期

【摘要】：針對現(xiàn)有交替數(shù)字二叉樹(ADT)方法的不足,引入輔助笛卡兒網(wǎng)格提出了一種基于散列數(shù)據(jù)結構的改進搜索方法以緩解可能出現(xiàn)堆棧溢出的問題和提高重疊網(wǎng)格裝配的效率。該方法以散列數(shù)據(jù)結構的方式對網(wǎng)格單元進行存儲和搜索,首先以輔助笛卡兒網(wǎng)格對網(wǎng)格單元的存儲空間進行初步映像,然后基于ADT搜索樹作進一步檢索。在ADT搜索方法的基礎上,笛卡兒網(wǎng)格的引入進一步縮小了網(wǎng)格單元的搜索范圍使得改進方法具有更好的效率�；趩蝹�網(wǎng)格節(jié)點,查詢深度和搜索耗時的測試顯示改進方法相比現(xiàn)有ADT搜索方法能使挖洞的平均效率提高25%以上。此外,挖洞結果和基于網(wǎng)格裝配的數(shù)值計算驗證了改進搜索方法在重疊網(wǎng)格裝配中的可靠性。
[Abstract]:Aiming at the shortcomings of the existing alternative digital binary tree (ADT) methods, an improved search method based on hash data structure is proposed to alleviate the possible stack overflow and improve the efficiency of overlapping mesh assembly. The method stores and searches grid cells in the form of hash data structure. Firstly, the primary image of the storage space of grid cells is made by auxiliary Cartesian grid, and then further retrieval is made based on ADT search tree. On the basis of ADT search method, the introduction of Cartesian mesh further reduces the search range of grid elements and makes the improved method more efficient. Based on a single grid node, the test results of query depth and search time show that the improved ADT search method can improve the average efficiency of digging by more than 25% compared with the existing ADT search method. In addition, the results of excavation and numerical calculation based on grid assembly verify the reliability of the improved search method in overlapping mesh assembly.
【作者單位】： 北京航空航天大學航空科學與工程學院;
【基金】：航空科學基金(20141251015)~~
【分類號】：O357.5

【相似文獻】

相關期刊論文 前1條

1 趙良孝;;介電掃描測井(ADT)[J];國外測井技術;2013年06期

相關會議論文 前1條

1 王文光;吳驪珠;佟振合;;芳環(huán)取代ADT氫化酶模型化合物催化質子還原的機理研究[A];中國化學會第26屆學術年會光化學分會場論文集[C];2008年

，

本文編號：2055629