Algorithm of the K Nearest Neighbor for the Mobility Inquirer
An efficient processing of k nearest neighbors queries is of critical importance to location based server with the ever-increasing deployment and use of mobile technologies. Voronoi diagram is applied broadly to query neighbors in geospatial context with which the definition of validity region and influence sets of a query q can be described. However, the quantity of neighbors of a spatial object in the Voronoi diagram is computed by connected relationship of polygons in the diagram which is influenced by the spatial distribution of local spatial objects. So, sometimes, it is impossible to determine the k nearest neighbors from Voronoi diagram directly. With the spatial reasoning processing, a method for the k nearest neighbors query processing is discussed in this paper.
Jianhua Mao Ling Ye
School of communication and Information Engineering, Research Centre of Remote Sensing and Spatial Information Science, Shanghai University, Shanghai 200072, China
国际会议
上海
英文
1557-1560
2010-10-20（万方平台首次上网日期，不代表论文的发表时间）