Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《ACTA GEODAETICA ET CARTOGRAPHIC SINICA》 1998-03
Add to Favorite Get Latest Update

A NEW ALGORITHM FOR SEARCHING NEIGHBORS IN THE LINEAR QUADTREE AND OCTREE

Xiao Lebin①, Gong Jianhua②, Xie Chuanjie①(①State Key Laboratory of Resources and Environment Information System, Institute of Geography, Chinese Academy of Sciences, Beijing,100101)(②Department of Geography & Joint Laboratory for Geoinf  
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.
【Fund】: 国家自然科学基金
【CateGory Index】: P208
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved