三维空间中的连续最近邻查询  

The CNN (Continuous Nearest Neighbor) Query of Three Dimensional Space

作　　者：闵寻优[1] 郝忠孝[1,2] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,黑龙江哈尔滨150080 [2]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001

出　　处：《软件》2011年第2期81-84,共4页Software

基　　金：省自然科学基金(No.F200601)~~

摘　　要：连续最近邻查询是空间数据库中一种非常重要的查询。在这个问题的研究中,多数是针对二维空间的。提出三维空间中的连续最近邻查询,它在现实中有着广泛的应用价值。提出了垂直平分面、分割点和邻接球等概念,给出了筛选规则、定理和查询算法,进行了实验,表明具有较高的查询效率。The continuous nearest neighbor query is one of the most important kind of queries in spatial databases.For the research of this problem,most of the research aim at two-dimensional space.The CNN query of three dimensional space is put forward,it has wide area of application in realism.Some concept is put forward,such as perpendicular bisector of plane,break point and adjacency ball.The filter rules,theorems and the query algorithms of the nearest neighbor query are proposed.The experiment is also given.The method of this paper has high query efficiency.

关 键 词：三维空间 连续最近邻查询 垂直平分面 邻接球 筛选规则 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]