An Algorithm of Neighbor Finding on Sphere Triangular Meshes with Quaternary Code

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.

第四级的代码的特征被分析。区分三角方向的规则被给出。邻居由从回到前面分解第四级的代码发现的一个算法在这篇论文被介绍。在这个算法和 Bartholdi 之间的时间复杂性的对比的分析是算法被接近。结果说明一般水准消费了这个算法的时间，这是大约 23.66% Bartholdi 的算法。