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

摘要

The characteristic of Quaternary codes is analyzed. The rule of distinguishing triangle direction is given out. An algorithm of neighbor finding by decomposing the Quaternary code from back to front is presented in this paper. The contrastive analysis of time complexity between this algorithm and Bartholdi's algorithm is approached. The result illustrates that the average consumed time of this algorithm is about 23.66% of Bartholdi's algorithm.