Abstract
We consider the problem of identifying preferred areas on a map which are characterized by a conjunction of minimum or maximum distance conditions from or to (classes of) points of interest. By applying state-of-the-art speed-up techniques for shortest path queries we achieve interactive response times allowing for an efficient web application even for country sized maps.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: hardware-accelerated shortest path trees. J. Parallel Distrib. Comput. 73(7), 940–952 (2013)
Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transp. Sci. 46(3), 388–404 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Funke, S. (2019). Identifying Preferred Areas in Road Networks. In: Kawai, Y., Storandt, S., Sumiya, K. (eds) Web and Wireless Geographical Information Systems. W2GIS 2019. Lecture Notes in Computer Science(), vol 11474. Springer, Cham. https://doi.org/10.1007/978-3-030-17246-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-17246-6_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-17245-9
Online ISBN: 978-3-030-17246-6
eBook Packages: Computer ScienceComputer Science (R0)