, Volume 12, Issue 4, pp 411–433

Processing Optimal Sequenced Route Queries Using Voronoi Diagrams



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.

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Information Laboratory (InfoLab), Computer Science DepartmentUniversity of Southern CaliforniaLos AngelesUSA

Personalised recommendations