期刊
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE
卷 31, 期 2, 页码 297-319出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/13658816.2016.1197399
关键词
Map generalization; polyline simplification; Perkal's proposal; Delaunay triangulation
类别
资金
- National Natural Science Foundation of China [41531180, 41401447]
As a basic and significant operator in map generalization, polyline simplification needs to work across scales. Perkal's epsilon-circle rolling approach, in which a circle with diameter epsilon is rolled on both sides of the polyline so that the small bend features can be detected and removed, is considered as one of the few scale-driven solutions. However, the envelope computation, which is a key part of this method, has been difficult to implement. Here, we present a computational method that implements Perkal's proposal. To simulate the effects of a rolling circle, Delaunay triangulation is used to detect bend features and further to construct the envelope structure around a polyline. Then, different connection methods within the enveloping area are provided to output the abstracted result, and a strategy to determine the best connection method is explored. Experiments with real land-use polygon data are implemented, and comparison with other algorithms is discussed. In addition to the scale-specificity inherited from Perkal's proposal, the results show that the proposed algorithm can preserve the main shape of the polyline and meet the area-maintaining constraint during large-scale change. This algorithm is also free from self-intersection.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据