Continuous K Nearest Neighbor Queries of Moving Objects in Road Networks

2010 ◽  
Vol 33 (8) ◽  
pp. 1396-1404 ◽  
Author(s):  
Liang ZHAO ◽  
Luo CHEN ◽  
Ning JING ◽  
Wei LIAO
2017 ◽  
Vol 22 (2) ◽  
pp. 237-268 ◽  
Author(s):  
Pengfei Zhang ◽  
Huaizhong Lin ◽  
Yunjun Gao ◽  
Dongming Lu

2012 ◽  
Vol 457-458 ◽  
pp. 461-466
Author(s):  
Ying Jie Wang

This paper analyzes several methods of the present continuous nearest neighbor queries and proposes a query algorithm based on R – tree through the geometric feature of this problem, the algorithms can not only avoid the loss of dividing points and high cost of the query, but also can finish the continuous nearest neighbor query for moving objects effectively.


Sign in / Sign up

Export Citation Format

Share Document