Institute of Theoretical Informatics, Algorithmics

Morphing of Polygonal Lines

Generalization of linear features in interactive maps

Depending on the scale objects in a map are displayed with different levels of detail. In cartography the simplification process that finds the right level of detail is known as generalization. Classical (paper) maps are designed for a fixed single scale and generalization is optimized such that the map is as readable as possible at the given scale. In today's web-based and interactive maps, however, the user can zoom in and out and fix his/her own scale. One can observe in current systems that linear objects like rivers or roads do not change smoothly. In our work we use dynamic programming in order to transform (or morph) a polygonal line as smooth as possible from one representation to another. To this end we identify characteristic segments of the two polygonal lines and match them optimally.

The example below shows the morphing of a road section. (Gray lines indicate the animation.)

(a) simple linear interpolation

(b) result of our algorithm

Joint work with Damian Merrick.

Publications

  1. Damian Merrick, Martin Nöllenburg, Alexander Wolff, and Marc Benkert. Morphing polygonal lines: A step towards continuous generalization. In Adam Winstanley, editor, Proc. 15th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK'07), pages 390-399, Maynooth, Ireland, 2007. [ bib | pdf ]
  2. Damian Merrick, Martin Nöllenburg, Alexander Wolff, and Marc Benkert. Morphing polygonal lines: A step towards continuous generalization. In Proc. 15th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK'07), pages 390-399, Maynooth, Ireland, 2007. [ bib | html | pdf ]