Moving Network Voronoi Diagram
文献类型：会议论文
| 作者 | Chenglin Fan; Jun Luo; Jianbiao He; Binhai Zhu |
| 出版日期 | 2010 |
| 会议名称 | 7th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2010 |
| 会议地点 | Quebec, QC |
| 英文摘要 | We study the problem of moving network Voronoi diagram: given a network with n nodes and E edges. Suppose there are m sites (cars, postmen, etc) moving along the network edges, we design the algorithms to compute the dynamic network Voronoi diagram as sites move such that we can answer the nearest neighbor query efficiently. Furthermore, we extend it to the k-order dynamic network Voronoi diagram such that we can answer the k nearest neighbor query efficiently. We also study the problem when the query point is allowed to move at a given speed |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/3137]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2010 |
| 推荐引用方式 GB/T 7714 | Chenglin Fan,Jun Luo,Jianbiao He,et al. Moving Network Voronoi Diagram[C]. 见:7th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2010. Quebec, QC. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。