URAN : A Unified Data Structure for Rendering and Navigation

No Thumbnail Available
Files
There are no files associated with this item.
Date
2017
Authors
Funke, Stefan
Schnelle, Niklas
Editors
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
DOI (citable link)
ArXiv-ID
International patent number
Link to the license
oops
EU project number
Project
Open Access publication
Restricted until
Title in another language
Research Projects
Organizational Units
Journal Issue
Publication type
Contribution to a conference collection
Publication status
Published
Published in
Web and Wireless Geographical Information Systems : 15th International Symposium, W2GIS 2017, Shanghai, China, May 8-9, 2017, Proceedings / Brosset, David et al. (ed.). - Cham : Springer, 2017. - (Lecture Notes in Computer Science ; 10181). - pp. 66-82. - ISSN 0302-9743. - eISSN 1611-3349. - ISBN 978-3-319-55997-1
Abstract
Current route planning services like Google Maps exhibit a clear-cut separation between the map rendering component and the route planning engine. While both rely on respective road network data, the route planning task is typically performed using state-of-the art data structures for speeding-up shortest/quickest path queries like Hub Labels, Arc Flags, or Transit Nodes, whereas the map rendering task usually involves a rendering framework like Mapnik or Kartograph. In this paper we show how to augment Contraction Hierarchies – another popular data structure for speeding-up shortest path queries – to also cater for the map rendering task. As a result we get a unified data structure (URAN) which lays the algorithmic foundation for novel map rendering and navigation systems. It also allows for customization of the map rendering, e.g. to accommodate different display devices (with varying resolution and hardware capabilities) or routing scenarios. At the heart of our approach lies a generalized graph simplification scheme derived from Contraction Hierarchies with a very lightweight augmentation for extracting (simplified) subgraphs. In a client-server scenario it additionally has the potential to shift the actual route computation to the client side, both relieving the server infrastructure as well as providing some degree of privacy when planning a route.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Conference
15th International Symposium, W2GIS 2017, May 8, 2017 - May 9, 2017, Shanghai, China
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690FUNKE, Stefan, Niklas SCHNELLE, Sabine STORANDT, 2017. URAN : A Unified Data Structure for Rendering and Navigation. 15th International Symposium, W2GIS 2017. Shanghai, China, May 8, 2017 - May 9, 2017. In: BROSSET, David, ed. and others. Web and Wireless Geographical Information Systems : 15th International Symposium, W2GIS 2017, Shanghai, China, May 8-9, 2017, Proceedings. Cham:Springer, pp. 66-82. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-55997-1. Available under: doi: 10.1007/978-3-319-55998-8_5
BibTex
@inproceedings{Funke2017-03-22Unifi-43544,
  year={2017},
  doi={10.1007/978-3-319-55998-8_5},
  title={URAN : A Unified Data Structure for Rendering and Navigation},
  number={10181},
  isbn={978-3-319-55997-1},
  issn={0302-9743},
  publisher={Springer},
  address={Cham},
  series={Lecture Notes in Computer Science},
  booktitle={Web and Wireless Geographical Information Systems : 15th International Symposium, W2GIS 2017, Shanghai, China, May 8-9, 2017, Proceedings},
  pages={66--82},
  editor={Brosset, David},
  author={Funke, Stefan and Schnelle, Niklas and 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/43544">
    <dc:contributor>Storandt, Sabine</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-10-16T11:46:43Z</dcterms:available>
    <dc:creator>Schnelle, Niklas</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Funke, Stefan</dc:creator>
    <dc:creator>Storandt, Sabine</dc:creator>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/43544"/>
    <dc:contributor>Schnelle, Niklas</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Funke, Stefan</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-10-16T11:46:43Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:language>eng</dc:language>
    <dcterms:title>URAN : A Unified Data Structure for Rendering and Navigation</dcterms:title>
    <dcterms:abstract xml:lang="eng">Current route planning services like Google Maps exhibit a clear-cut separation between the map rendering component and the route planning engine. While both rely on respective road network data, the route planning task is typically performed using state-of-the art data structures for speeding-up shortest/quickest path queries like Hub Labels, Arc Flags, or Transit Nodes, whereas the map rendering task usually involves a rendering framework like Mapnik or Kartograph. In this paper we show how to augment Contraction Hierarchies – another popular data structure for speeding-up shortest path queries – to also cater for the map rendering task. As a result we get a unified data structure (URAN) which lays the algorithmic foundation for novel map rendering and navigation systems. It also allows for customization of the map rendering, e.g. to accommodate different display devices (with varying resolution and hardware capabilities) or routing scenarios. At the heart of our approach lies a generalized graph simplification scheme derived from Contraction Hierarchies with a very lightweight augmentation for extracting (simplified) subgraphs. In a client-server scenario it additionally has the potential to shift the actual route computation to the client side, both relieving the server infrastructure as well as providing some degree of privacy when planning a route.</dcterms:abstract>
    <dcterms:issued>2017-03-22</dcterms:issued>
  </rdf:Description>
</rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Contact
URL of original publication
Test date of URL
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
No
Refereed