Nearest Neighbor Search Algorithm for the GBD Tree Spatial Data Structure

摘要：

The present paper describes the nearest neighbor (NN) search algorithm on the GBD(generalized BD)tree. The GBD tree is a spatial data structure suitable for two- or three-dimensional data and has good performance characteristics with respect to the dynamic data environment. On GIS and CAD systems,the R-tree and its successors have been used. In addition, the NN search algorithm has also been proposed in an attempt to obtain good performance from the R-tree. On the other hand, the GBD tree is superior to the R-tree with respect to exact match retrieval, because the GBD tree has auxiliary data that uniquely determines the position of the object in the structure. The NN search algorithm proposed in the present paper depends on the property of the GBD tree described above. In the present paper, the NN search algorithm on the GBD tree is described and the performance thereof is evaluated through experiments.

作者: Yutaka Ohsawa Takanobu Kurihara Ayaka Ohki

作者单位: Saitama University

会议类型: 国际会议

会议名称: The 5th Asian Symposium on Geographic Information Systems from Computer Science & Engineering View(ASGIS 2007)(第五届亚洲地理信息系统国际学术研讨会)

会议地点: 重庆

会议语种:英文

页码: 1-8

在线出版日期: 2007-04-24（万方平台首次上网日期，不代表论文的发表时间）