|
|||||
|
|
| 基于Delaunay图的反向最近邻查询 | |
| 引用本文： | 王淼,郝忠孝.基于Delaunay图的反向最近邻查询[J].计算机工程,2010,36(5):59-61. |
| 作者姓名： | 王淼 郝忠孝 |
| 作者单位： | 1. 哈尔滨理工大学计算机科学与技术学院,哈尔滨,150080 2. 哈尔滨理工大学计算机科学与技术学院,哈尔滨,150080;哈尔滨工业大学计算机科学与技术学院,哈尔滨,150001 |
| 基金项目： | 黑龙江省自然科学基金资助项目(F2006-01) |
| 摘 要： | 将查询点作为Delaunay图的一个生成点，利用Delaunay图的生成点与其邻接生成点之间的关系，在查询点的邻接生成点集(元素个数小于等于6)中计算数据集中给定点的反向最近邻。把伴随Delaunay图增量生成过程产生的Delaunay树作为查询索引结构，该结构能存储Delaunay图，在数据点插入和删除时维护Delaunay图的拓扑结构。 |
| 关 键 词： | 反向最近邻 Delaunay图 Delaunay树 |
| 修稿时间： | |
Reverse Nearest Neighbor Query Based on Delaunay Diagram |
|
| WANG Miao,HAO Zhong-xiao.Reverse Nearest Neighbor Query Based on Delaunay Diagram[J].Computer Engineering,2010,36(5):59-61. | |
| Authors: | WANG Miao HAO Zhong-xiao |
| Affiliation: | (1. College of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080; 2. College of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001) |
| Abstract: | This paper takes query point as a generation point of Delaunay diagram and utilizes the relationship between this point and its adjacent generation point to search Reverse Nearest Neighbor(RNN) in adjacent generation point set(less than six elements) of query point. It takes Delaunay tree generated during the process of Delaunay incremental generation as the query index structure, which can store Delaunay diagram and maintain Delaunay diagram topology when a point is added or deleted. |
| Keywords: | Reverse Nearest Neighbor(RNN) Delaunay diagram Delaunay tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机工程》浏览原始摘要信息 | |
| 点击此处可从《计算机工程》下载全文 | |