Research in Continuous Nearest Neighbor Queries
2012 ◽
Vol 457-458
◽
pp. 461-466
Keyword(s):
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.
2010 ◽
Vol 33
(8)
◽
pp. 1396-1404
◽
2005 ◽
pp. 270-279
◽
2016 ◽
Vol 9
(4)
◽
pp. 151-160
◽
Keyword(s):
2011 ◽
Vol 22
(8)
◽
pp. 1805-1815
◽
Keyword(s):
Keyword(s):