Advertisement
Published in:
2011 | OriginalPaper | Chapter
Continuous-Time Moving Network Voronoi Diagram
Authors : Chenglin Fan, Jun Luo, Binhai Zhu
Published in: Transactions on Computational Science XIV
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.