摘要
线性四叉树和线性八叉树邻域寻找的一种新算法肖乐斌①龚建华②谢传节①（①中国科学院地理研究所资源与环境信息系统国家重点实验室，北京，１００１０１）（②香港中文大学地理系地球信息科学联合实验室，香港）ＡＮＥＷＡＬＧＯＲＩＴＨＭＦＯＲＳＥＡＲＣＨＩＮＧＮＥ...
In This paper, based on the analyses of algorithms for searching neighbor pixels in linear quadtrees and neighbor octants in linear octrees and deeply studying on the characters of codes in linear quadtrees or octrees, such as direction, hierarchy, compressibility and size difference characters, a new searching algorithm is presented, which is directly in light of the code number and doesn't use the comparison method described in fore researchers' algorithms any more. For the searching of same size neighbors of a code, only a few rear digits of the code need to be checked. For the searching of different size neighbors of a code, based on the acquired same size neighbor code, only a few fore digits of the code need to be checked in light of the hierarchy and size difference character of codes in linear quadtrees and octrees. Because of its simple structure, this algorithm is easy to understand for readers and realize on computers, with a character of consuming time less. For the searching of a part of neighbors, only one time adding or subtracting operation is enough. The experiment results verify that the new algorithm is correct, simple and less consuming time.
出处
《测绘学报》
EI
CSCD
北大核心
1998年第3期195-203,共9页
Acta Geodaetica et Cartographica Sinica
基金
国家自然科学基金
