Incremental maintenance of all-nearest neighbors based on road network

  • Authors:

  • Jun Feng;Naoto Mukai;Toyohide Watanabe

  • Affiliations:

  • Department of Information Engineering, Graduate School of Engineering, Nagoya University, Nagoya, Aichi, Japan and College of Computer and Information Engineering, Hohai University, Nanjing, Jiang ...;Department of Systems and Social Informatics, Graduate School of Information Science, Nagoya University, Nagoya, Aichi, Japan;Department of Systems and Social Informatics, Graduate School of Information Science, Nagoya University, Nagoya, Aichi, Japan

  • Venue:
  • IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a method to incrementally maintain all-nearest neighbors on road network. The nearest neighbor on road network is computed based on the path length between a pair of objects. To achieve an efficient maintenance process of all-nearest neighbors on road network, the cost of path search should be decreased. A method is proposed for efficient path search by minimizing the search region based on the previous results and heuristics.