Advertisement

Automatic Generation of Route Sketches

  • Andreas Gemsa
  • Martin Nöllenburg
  • Thomas Pajor
  • Ignaz Rutter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6502)

Introduction

Generating route sketches is a graph redrawing problem, where we are given an initial drawing of a graph G and want to find a new, schematized drawing of G that reduces the drawing complexity while preserving the structural characteristics of the input. The motivation of our work is the visualization of routes in road networks as sketches for driving directions. An important property of a route sketch is that it focuses on road changes and important landmarks rather than exact geography and distances. Typically the start and destination lie in populated areas that are locally reached via a sequence of relatively short road segments. On the other hand, the majority of the route typically consists of long highway segments with no or only few road changes. This property makes it difficult to display driving directions for the whole route in a single traditional map since some areas require much smaller scales than others. The strength of route sketches for this purpose is that they are not drawn to scale but rather use space proportionally to the route complexity.

References

  1. 1.
    Agrawala, M., Stolte, C.: Rendering effective route maps: Improving usability through generalization. In: Proc. 28th Ann. Conf. Computer Graphics and Interactive Techniques (SIGGRAPH 2001), pp. 241–249. ACM, New York (2001)Google Scholar
  2. 2.
    Brandes, U., Pampel, B.: On the hardness of orthogonal-order preserving graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 266–277. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Delling, D., Gemsa, A., Nöllenburg, M., Pajor, T.: Path schematization for route sketches. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 285–296. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Nöllenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Visualization and Computer Graphics (2010), doi: 10.1109/TVCG.2010.81Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Andreas Gemsa
    • 1
  • Martin Nöllenburg
    • 1
    • 2
  • Thomas Pajor
    • 1
  • Ignaz Rutter
    • 1
  1. 1.Institute of Theoretical InformaticsKarlsruhe Institute of Technology (KIT)Germany
  2. 2.Department of Computer ScienceUniversity of CaliforniaIrvineUSA

Personalised recommendations