Morphing polylines:: A step towards continuous generalization

被引：48

作者：

Noellenburg, Martin ^{[1
]}

Merrick, Damian ^{[2
,3
]}

Wolff, Alexander ^{[4
]}

Benkert, Marc ^{[1
]}

机构：

[1] Univ Karlsruhe, Fac Informat, D-76128 Karlsruhe, Germany

[2] Univ Sydney, Sch Informat Technol, Sydney, NSW 2006, Australia

[3] Natl ICT Australia, Alexandria, NSW 1435, Australia

[4] Tech Univ Eindhoven, Fac Wiskunde Informat, NL-5600 MB Eindhoven, Netherlands

来源：

COMPUTERS ENVIRONMENT AND URBAN SYSTEMS | 2008年 / 32卷 / 04期

基金：

澳大利亚研究理事会;

关键词：

continuous generalization; morphing; dynamic programming; line simplification;

D O I：

10.1016/j.compenvurbsys.2008.06.004

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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 in 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. (C) 2008 Elsevier Ltd. All rights reserved.

引用

页码：248 / 260

页数：13