| Voronoi图的首最邻近递归收敛特性及其应用 |
| |
| 引用本文： | 闫超德, 赵仁亮, 陈军, 赵学胜. Voronoi图的首最邻近递归收敛特性及其应用[J]. 武汉大学学报 ( 信息科学版), 2008, 33(11): 1194-1197. |
| |
| 作者姓名： | 闫超德 赵仁亮 陈军 赵学胜 |
| |
| 作者单位： | 1郑州大学环境与水利学院,郑州市科学大道100号450001;2国家基础地理信息中心,北京市紫竹院百胜村1号100044;3中国矿业大学(北京)资源与安全工程学院,北京市海淀区学院路丁11号100083 |
| |
| 摘 要： | 讨论了Voronoi图的首最邻近递归收敛特性,即从任一伪最邻近对象开始,递归查找其首最邻近对象,最后必然收敛于最邻近对象。利用该特性,初步实现了移动目标直接邻近对象的连续查询。
|
| 关 键 词： | Voronoi图 最邻近 首最邻近 移动目标 直接邻近 |
| 收稿时间： | 2008-09-17 |
| 修稿时间： | 2008-09-17 |
Voronoi Diagram's Recursive Convergence Characteristic Along Preferred Possible Nearest Neighbor Objects and Its Application |
| |
| YAN Chaode, ZHAO Renliang, CHEN Jun, ZHAO Xuesheng. Voronoi Diagram's Recursive Convergence Characteristic Along Preferred Possible Nearest Neighbor Objects and Its Application[J]. Geomatics and Information Science of Wuhan University, 2008, 33(11): 1194-1197. |
| |
| Authors: | YAN Chaode ZHAO Renliang CHEN Jun ZHAO Xuesheng |
| |
| Affiliation: | 1School of Environment and Water Conservancy Engineering,Zhengzhou University,100 Science Road,Zhengzhou 450001,China;2National Geomatics Center of China,1 Baishengcun,Zizhuyuan,Beijing 100044,China;3School of Resources and Safety Engineering,China University of Mining and Technology(Beijing |
| |
| Abstract: | In the field of GIS,in-depth study of Voronoi diagram's dynamic geometric characteristics will contribute the achievement of complex spatial relations queries.Voronoi diagram's recursive convergence characteristic along preferred possible nearest neighbor objects is discussed,i.e.any search from pseudo neighbor object along preferred possible nearest neighbor objects can reach the nearest object.An application case,which realizes continuous queries of moving object's immediate neighbor objects based on this characteristics,is used to illustrate the value of this characteristic. |
| |
| Keywords: | Voronoi diagram nearest neighbor preferred possible nearest neighbor moving object immediate neighbor |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息 |
|
点击此处可从《武汉大学学报(信息科学版)》下载全文 |
