基于Quaternary编码的球面三角格网邻近搜索算法

Algorithm of Neighbor Finding on Sphere Triangular Meshes with Quaternary Code

分析了球面Quaternary编码的特点,给出了三角格网方向判断的规则,并对该算法与Bartholdi邻近搜索算法的时间复杂度进行了对比。结果表明,分解算法的平均时间耗时量约是Bartholdi邻近搜索算法的23.66%。

The characteristic of Quaternary codes is analyzed. The rule of distinguishing triangle direction is given out. The algorithm of neighbor finding from back to front with decomposing Quaternary code is presented. The analysis of time complexity between this decomposing algorithm and bartholdi＇s algorithm is approached. The result is that average consumed time of this decomposing algorithm is about 23.66% of Bartholdi＇s.