摘要
数据集中的强邻近对查询在地理信息系统、图像处理和多媒体数据库等领域有着重要的应用。为了解决数据集中强邻近对查询问题,基于Voronoi图对数据集中强邻近对问题进行了详细研究,给出了在无障碍物和有障碍物环境下查询数据点集中强邻近对的定理和算法,设计了相应的数据存储结构,对在无障碍物和有障碍物环境下的查询数据集中的强邻近对问题进行了实验分析。该方法可较好的解决曲面空间和有障碍物空间中的数据集中强邻近对的查询问题。
The strong neighborhood pair query has important application in geographical information systems, image manipulation and multimedia database. To deal with the strong neighborhood pair query in the datasets, the strong neighborhood pair query is studied detailedly based＇on the voronoi diagram. The theorems and algorithms of searching the strong neighborhood pair in the datasets without barriers or with barriers are proposed. To search the points in the database, the corresponding structures of the database are constructed and the experiments for the algorithms are given. The methods can deal with the strong neighborhood pair query of the datasets in the curl surface and the space with barriers.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第16期4353-4355,4359,共4页
Computer Engineering and Design
基金
黑龙江省研究生创新科研基金项目(YJSCX2006-13HLJ)
关键词
最近对
VORONOI图
生成点
强邻近对
障碍线
最近邻
closest pair
voronoi diagram
generate points
strong neighborhood pair
barry line
nearest neighbor
