Publikation: Region-Aware Route Planning
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
We consider route planning queries in road or path networks which involve a user preference expressed in relation to a spatial region, as e.g. ‘from Nanjing to Shanghai along Yangtze river’ or ‘from home to work through Central Park’. To answer such queries, we carefully define relevant subgraphs of the network for each region-of-interest and guide the route towards them. To extract these subgraphs, we need to solve several non-trivial geometric problems (as computing weak visibility regions), which require to interpret the embedded network both as a graph and as an arrangement of line segments. We describe a suitable preprocessing framework, taking the special structure of road networks into account to increase its performance. Our query answering algorithm then allows to trade detour length against time spent within or close to the desired region. Using acceleration techniques, region-aware routes can be planned efficiently even in networks with millions of edges, and also when considering large or complex regions.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
STORANDT, Sabine, 2018. Region-Aware Route Planning. 16th International Symposium, W2GIS 2018. A Coruña, Spain, 21. Mai 2018 - 22. Mai 2018. In: LUACES, Miguel R., ed. and others. Web and Wireless Geographical Information Systems : 16th International Symposium, W2GIS 2018, A Coruña, Spain, May 21-22, 2018, Proceedings. Cham: Springer, 2018, pp. 101-117. Lecture Notes in Computer Science. 10819. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-90052-0. Available under: doi: 10.1007/978-3-319-90053-7_11BibTex
@inproceedings{Storandt2018Regio-43343, year={2018}, doi={10.1007/978-3-319-90053-7_11}, title={Region-Aware Route Planning}, number={10819}, isbn={978-3-319-90052-0}, issn={0302-9743}, publisher={Springer}, address={Cham}, series={Lecture Notes in Computer Science}, booktitle={Web and Wireless Geographical Information Systems : 16th International Symposium, W2GIS 2018, A Coruña, Spain, May 21-22, 2018, Proceedings}, pages={101--117}, editor={Luaces, Miguel R.}, author={Storandt, Sabine} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/43343"> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-09-20T13:27:39Z</dc:date> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:title>Region-Aware Route Planning</dcterms:title> <dc:creator>Storandt, Sabine</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-09-20T13:27:39Z</dcterms:available> <dc:language>eng</dc:language> <dcterms:issued>2018</dcterms:issued> <dc:contributor>Storandt, Sabine</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/43343"/> <dcterms:abstract xml:lang="eng">We consider route planning queries in road or path networks which involve a user preference expressed in relation to a spatial region, as e.g. ‘from Nanjing to Shanghai along Yangtze river’ or ‘from home to work through Central Park’. To answer such queries, we carefully define relevant subgraphs of the network for each region-of-interest and guide the route towards them. To extract these subgraphs, we need to solve several non-trivial geometric problems (as computing weak visibility regions), which require to interpret the embedded network both as a graph and as an arrangement of line segments. We describe a suitable preprocessing framework, taking the special structure of road networks into account to increase its performance. Our query answering algorithm then allows to trade detour length against time spent within or close to the desired region. Using acceleration techniques, region-aware routes can be planned efficiently even in networks with millions of edges, and also when considering large or complex regions.</dcterms:abstract> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> </rdf:Description> </rdf:RDF>