将正八面体上下相邻的两个三角形面片合并成一个四分体,建立二维坐标系,在此基础上采用六边形格网单元的层次编码方案,分析了不同位置格网单元的编码特征,提出了一种“孔4双轴查找算法”,实现了相应的邻接单元及父、子单元查找,并进行了相关实验及对比分析。结果表明,该算法和传统的Vince算法相比较,邻接单元查找速度提高了约900倍,父单元和子单元的查找速度均提高了约120倍。

Take octahedron as an example, the aperture 4 hexagonal discrete global grids (A4HDGGs) is analyzed in this paper. The two adjacent triangle patches (up and down) in the platonic polyhedron are merged into one quadrilateral to create a twodimensional coordinate system, and the hierarchical location coding on A4HDGGs is therefore put forward. Firstly, the coding characteristics of A4HDGGs in different positions are analyzed. Secondly, a searching algorithm for A4HDGG, called A4-2D-coordinates, is given in details. Finally, the experimental analysis is developed. The effi ciency of neighbor-fi nding, children-fi nding, and parent-fi nding in this algorithm have been validated by the experimental results to improve respectively by 900 times, 120 times and 120 times compared with traditional Vince algorithm.