节点文献

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

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

推荐 CAJ下载
PDF下载
不支持迅雷等下载工具，请取消加速工具后下载。

【Author】 Sun Wenbin Zhao XueshengSUN Webin, School of Resource and Safety Engineering, China University of Mining and Technology (Beijing), D11 Xueyuan Road, Beijing100083, China.

【机构】 School of Resource and Safety Engineering China University of Mining and Technology (Beijing)； D11 Xueyuan Road； Beijing100083； China；

【摘要】 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 pre-sented in this paper. The contrastive analysis of time complexity between this algorithm and Bartholdi’s algo-rithm is approached. The result illustrates that the average consumed time of this algorithm is about 23.66% of Bartholdi’s algorithm.更多还原

【Abstract】 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 pre-sented in this paper. The contrastive analysis of time complexity between this algorithm and Bartholdi’s algo-rithm is approached. The result illustrates that the average consumed time of this algorithm is about 23.66% of Bartholdi’s algorithm.更多还原

【关键词】 Quaternary code； neighbor finding； sphere triangular mesh；
【Key words】 Quaternary code； neighbor finding； sphere triangular mesh；

【基金】 the Natural Science Foundation of China (No. 40771169; No.40471108; No.40701152)

【文献出处】 Geo-Spatial Information Science ,地球空间信息科学学报(英文版) , 编辑部邮箱 ,2008年02期

【分类号】P208
【被引频次】1
【下载频次】69

知网节下载

节点文献中：

本文链接的文献网络图示:

本文的引文网络

节点文献