重叠网格装配中的一种改进ADT搜索方法

发布时间：2018-06-23 03:51

本文选题：重叠网格 + 网格装配　；参考：《北京航空航天大学学报》2017年06期

【摘要】：针对现有交替数字二叉树(ADT)方法的不足,引入辅助笛卡儿网格提出了一种基于散列数据结构的改进搜索方法以缓解可能出现堆栈溢出的问题和提高重叠网格装配的效率。该方法以散列数据结构的方式对网格单元进行存储和搜索,首先以辅助笛卡儿网格对网格单元的存储空间进行初步映像,然后基于ADT搜索树作进一步检索。在ADT搜索方法的基础上,笛卡儿网格的引入进一步缩小了网格单元的搜索范围使得改进方法具有更好的效率。基于单个网格节点,查询深度和搜索耗时的测试显示改进方法相比现有ADT搜索方法能使挖洞的平均效率提高25%以上。此外,挖洞结果和基于网格装配的数值计算验证了改进搜索方法在重叠网格装配中的可靠性。
[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

【相似文献】