Morphing polylines: A step towards continuous generalization

M. Nöllenburg, D. Merrick, A. Wolff, M. Benkert

Research output: Contribution to journalArticleAcademicpeer-review

44 Citations (Scopus)

Abstract

We study the problem of morphing between two polylines that represent linear geographical features like roads or rivers generalized at two different scales. This problem occurs frequently during continuous zooming in interactive maps. Situations in which generalization operators like typification and simplification replace, for example, a series of consecutive bends by fewer bends are not always handled well by traditional morphing algorithms. We attempt to cope with such cases by modeling the problem as an optimal correspondence problem between characteristic parts of each polyline. A dynamic programming algorithm is presented that solves the matching problem in O(nm) time, where n and m are the respective numbers of characteristic parts of the two polylines. In a case study we demonstrate that the algorithm yields good results when being applied to data from mountain roads, a river and a region boundary at various scales.
Original languageEnglish
Pages (from-to)248-260
JournalComputers, Environment and Urban Systems
Volume32
Issue number4
DOIs
Publication statusPublished - 2008

Fingerprint

Dive into the research topics of 'Morphing polylines: A step towards continuous generalization'. Together they form a unique fingerprint.

Cite this