By Topic

Voronoi-based k-path nearest neighbor query in road networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zijun Chen ; Coll. of Inf. Sci. & Eng., Yanshan Univ., Qinhuangdao, China ; Jingjing Han ; Baowen Wang ; Wenyuan Liu

To satisfy the real-time requirement of k-path nearest neighbor (kPNN) query, the Voronoi-Based k-Path Nearest Neighbor (VBk-PNN) algorithm based on the pre-computed Voronoi-based Network Nearest Neighbor (VN3) is proposed in this paper. Depending on the pre-computation idea and using a di-Dijkstra's algorithm search scheme to acquire the shortest path from the current location to destination, then, the nodes in the shortest path are got. At last, some nodes in same NVP as a set to search these nodes' nearest neighbor, then these nodes' nearest neighbors are optimized by a priority queue in order to get the correct kPNN. The performance of VBk-PNN is more efficient about kPNN query speed than Best-first Network Expansion (BNE).

Published in:

Computer and Information Application (ICCIA), 2010 International Conference on

Date of Conference:

3-5 Dec. 2010