Benchmark of efficient data structures for recognising movable objects

In previous research a passenger assistance system to detect arriving buses was developed. In this paper, more investigation is made concerning the implementation of an efficient server for managing arriving buses and informing waiting users. Three different search structures are described and their suitability for the server is evaluated. The data points for the search were extracted from OpenStreetMap to get a realistic point distribution.

[1]  Cyrus Shahabi,et al.  Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases , 2004, VLDB.

[2]  Jürgen Sieck,et al.  Recognition of movable objects , 2011, Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems.

[3]  Peter Sanders,et al.  Simple and Fast Nearest Neighbor Search , 2010, ALENEX.

[4]  Ashraf M. Kibriya,et al.  Fast Algorithms for Nearest Neighbour Search , 2007 .

[5]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.