| 基于Quaternary编码的球面三角格网邻近搜索算法(英文) |
| |
| 作者单位： | School of Resource and Safety Engineering China University of Mining and Technology (Beijing)，D11 Xueyuan Road，Beijing100083，China |
| |
| 基金项目： | Supported by the Natural Science Foundation of China （No. 40771169; No.40471108; No.40701152）. |
| |
| 摘 要： | 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.
|
| 关 键 词： | 第四纪 密码 球形 三角形 测绘数据 |
An algorithm of neighbor finding on sphere triangular meshes with quaternary code |
| |
| Authors: | Wenbin Sun Xuesheng Zhao |
| |
| 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. |
| |
| Keywords: | Quaternary code neighbor finding sphere triangular mesh |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
