Today's wayfinding assistance systems provide route directions that are significantly different to those generated by humans, resulting in a gap between what users expect and what the system delivers. This dissertation contributes to closing this gap by presenting a process that adapts instructions to environmental characteristics and a route's properties, thereby implementing principles of human direction giving. The process generates an abstract, relational specification of route directions, which can, for example, be externalized verbally.

No abstract

There is an increasing number of rapidly growing repositories capturing the movement of people in space-time. Movement trajectory compression becomes an obvious necessity for coping with such growing data volumes. This paper introduces the concept of semantic trajectory compression (STC). STC allows for substantially compressing trajectory data with acceptable information loss. It exploits that human urban mobility typically occurs in transportation networks that define a geographic context for the movement. In STC, a semantic representation of the trajectory that consists of reference points localized in a transportation network replaces raw, highly redundant position information (e.g., from GPS receivers). An experimental evaluation with real and synthetic trajectories demonstrates the power of STC in reducing trajectories to essential information and illustrates how trajectories can be restored from compressed data. The paper discusses possible application areas of STC trajectories

Abstract. Shape simplification in map-like representations is used for two reasons: either to abstract from irrelevant detail to reduce a map user's cognitive load, or to simplify information when a map of a smaller scale is derived from a detailed reference map. We present a method for abstracting simplified cartographic representations from more accurate spatial data. First, the employed method of discrete curve evolution developed for simplifying perceptual shape characteristics is explained. Specific problems of applying the method to cartographic data are elaborated. An algorithm is presented, which on the one hand simplifies spatial data up to a degree of abstraction intended by the user; and which on the other hand does not violate local spatial ordering between (elements of) cartographic entities, since local arrangement of entities is assumed to be an important spatial knowledge characteristic. The operation of the implemented method is demonstrated using two different examples of cartographic data.