A threshold-based algorithm for continuous monitoring of k nearest neighbors

Assume a set of moving objects and a central server that monitors their positions over time, while processing continuous nearest neighbor queries from geographically distributed clients. In order to always report up-to-date results, the server could constantly obtain the most recent position of all objects. However, this naive solution requires the… CONTINUE READING

16 Figures & Tables

Topics

Statistics

0204060'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

244 Citations

Semantic Scholar estimates that this publication has 244 citations based on the available data.

See our FAQ for additional information.