Incorporating landmarks with quality measures in routing procedures

Authors:
Birgit Elias;Monika Sester
Affiliations:
ikg – Institute of Cartography and Geoinformatics, University of Hannover, Hannover, Germany;ikg – Institute of Cartography and Geoinformatics, University of Hannover, Hannover, Germany
Venue:
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Year:
2006

Citing 7
Cited 4

Digital Image Processing

Digital Image Processing
Modeling Costs of Turns in Route Planning

Geoinformatica
Pictorial and Verbal Tools for Conveying Routes

COSIT '99 Proceedings of the International Conference on Spatial Information Theory: Cognitive and Computational Foundations of Geographic Information Science
The Nature of Landmarks for Real and Electronic Spaces

COSIT '99 Proceedings of the International Conference on Spatial Information Theory: Cognitive and Computational Foundations of Geographic Information Science
Pictorial representations of routes: chunking route segments during comprehension

Spatial cognition III
Structural salience of landmarks for route directions

COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory
A model for context-specific route directions

SC'04 Proceedings of the 4th international conference on Spatial Cognition: reasoning, Action, Interaction

Towards a Conceptual Model of Talking to a Route Planner

W2GIS '08 Proceedings of the 8th International Symposium on Web and Wireless Geographical Information Systems
Easiest-to-reach neighbor search

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Mining Travel Patterns from Geotagged Photos

ACM Transactions on Intelligent Systems and Technology (TIST)
GPSView: A scenic driving route planner

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an approach to providing landmark-based routes using a shortest-path algorithm. We start from the assumption, that at one junction there can be several landmarks to choose among, in order to find an optimal description of a route. The landmark selection used for describing the route is optimized taking the quality measures for the landmarks into account. Therefore, it is necessary to define quality measures. In the paper different types of quality measures are introduced and their integration in the route graph, as well as in a routing algorithm is presented. The usability of the approach is demonstrated using test data.