Name
Abstract | ||
|---|---|---|
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. Moreover, we give the algorithm for the half-online version of moving network Voronoi diagram. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-25249-5_5 | Transactions on Computational Science |
Keywords | DocType | Volume |
half-online version,network voronoi diagram,query point,nearest neighbor query,k-order dynamic network voronoi,m site,network edge,dynamic network voronoi diagram,e edge,neighbor query | Journal | 14 |
Issue | Citations | PageRank |
null | 1 | 0.36 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chenglin Fan | 1 | 28 | 7.24 |
| Jun Luo | 2 | 222 | 26.61 |
| Binhai Zhu | 3 | 903 | 109.96 |