基于线性四叉树的全球离散格网索引

Indexing of Discrete Global Grids Using Linear Quadtree

将四元三角剖分的三角形格网组织成四叉树剖分的菱形块格网,以菱形块单元来进行数据的组织索引,通过线性四叉树成熟的Morton编码作为关键字来标识查找菱形块,并在此基础上经过改进来索引三角形格网、进行邻域搜索。

In this paper the surface of the octahedron is regarded as composed of pairs of adjacent triangles, or diamond, that tessellate the surface, and thus creates nested diamond subdivision of the surface of the global by quadtree recursive partition. The quadtree Morton coding system is used as the index for addressing the diamonds and for linearizing storage that preserve a high degree of spatial locality. And a method of finding neighbor, ancestors and desendants also is introduced.