%0 Journal Article
%T Nearest neighbor search algorithm for GBD tree spatial data structure<br>Nearest neighbor search algorithm forGBD tree spatial data structure
%A Yutaka Ohsawa
%A Takanobu Kurihara
%A Ayaka Ohki
%A <br>Yutaka Ohsaw
%A Takanobu Kurihar
%A Ayaka Ohki
%J 重庆邮电大学学报(自然科学版)
%D 2007
%I 
%X This 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 is also 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 proposed NN search algorithm depends on the property of the GBD tree described above. The NN search algorithm on the GBD tree was studied and the performance thereof was evaluated through experiments.
%K nearest neighbor search algorithm
%K GBD tree
%K spatial data structure<br>邻居搜索算法
%K GBD树
%K 空间数据结构
%K 动态数据环境
%K 地理信息系统
%K 计算机辅助设计
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=96E6E851B5104576C2DD9FC1FBCB69EF&jid=5C2694A2E5629ECD6B59D7B28C6937AD&aid=FC6858E37B9E53629CA19E47FA9F12F4&yid=A732AF04DDA03BB3&vid=2A8D03AD8076A2E3&iid=38B194292C032A66&sid=82722E2B785EBF0D&eid=0F7768518993EDDE&journal_id=1673-825X&journal_name=重庆邮电大学学报(自然科学版)&referenced_num=0&reference_num=10