Moving Network Voronoi Diagram

  • Authors:

  • Chenglin Fan;Jianbiao He;Jun Luo;Binhai Zhu

  • Affiliations:

  • -;-;-;-

  • Venue:
  • ISVD '10 Proceedings of the 2010 International Symposium on Voronoi Diagrams in Science and Engineering
  • Year:
  • 2010

  • Voronoi diagram with visual restriction

    FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index 0.00

Visualization

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, \emph{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.