Morphing polygonal lines : a step towards continuous generalization

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

62 Downloads (Pure)


We study the problem of morphing between two polylines that represent a geographical feature generalized at two different scales. Some cartographical generalizations are not handled well by traditional morphing algorithms, e.g., when three consecutive bends in a river or road are generalized to two bends at a smaller scale. We attempt to handle such cases by modeling the problem as an optimal matching 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 number of characteristic parts of the two polylines. We also show the results of applying this algorithm on real road data.
Original languageEnglish
Title of host publicationCollection of Abstracts of the 23rd European Workshop on Computational Geometry (EWCG 2007) 19-21 March 2007, Graz, Austria
EditorsO. Aichholzer, T. Hackl
Place of PublicationGraz, Austria
PublisherVerlag der Technischen Universität Graz
ISBN (Print)978-3-902465-62-7
Publication statusPublished - 2007
Eventconference; EWCG 2007, Graz, Austria; 2007-03-19; 2007-03-21 -
Duration: 19 Mar 200721 Mar 2007


Conferenceconference; EWCG 2007, Graz, Austria; 2007-03-19; 2007-03-21
OtherEWCG 2007, Graz, Austria


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

Cite this