Multi-type nearest neighbor queries in road networks with time window constraints
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Voronoi-based multi-level range search in mobile navigation
Multimedia Tools and Applications
Continuous visible nearest neighbor query processing in spatial databases
The VLDB Journal — The International Journal on Very Large Data Bases
On multi-type reverse nearest neighbor search
Data & Knowledge Engineering
Tour suggestion for outdoor activities
W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems
| Hi-index | 0.00 |
The Optimal Sequenced Route (OSR) query strives to find a route of minimum length starting from a given source location and passing through a number of typed locations in a specific sequence imposed on the types of the locations. In this paper, we propose a pre-computation approach to OSR query in both vector and metric spaces. We exploit the geometric properties of the solution space and theoretically prove its relation to additively weighted Voronoi diagrams. Our approach recursively accesses these diagrams to incrementally build the OSR. Introducing the analogous diagrams for the space of road networks, we show that our approach is also efficiently applicable to this metric space. Our experimental results verify that our pre-computation approach outperforms the previous index-based approaches in terms of query response time.