文章基本信息

标题：An algorithm of neighbor finding on sphere triangular meshes with quaternary code
本地全文：下载
作者：Wenbin Sun ; Xuesheng Zhao
期刊名称：Geo-spatial Information Science
印刷版ISSN：1009-5020
电子版ISSN：1993-5153
出版年度：2008
卷号：11
期号：2
页码：86-89
DOI：10.1007/s11806-008-0009-8
出版社：Taylor and Francis Ltd
摘要：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.
关键词：Quaternary code; neighbor finding; sphere triangular mesh