期刊名称：ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
印刷版ISSN：2194-9042
电子版ISSN：2194-9050
出版年度：2007
卷号：XXXVI-5/C55
出版社：Copernicus Publications
摘要：Line simplification is one of the generalization methods, used when converting large scale maps to smaller ones. This method is applied on linear features and boundaries of polygons. Most algorithms work on the vertices of the linear features. These algorithms accept some vertex points to remain on their position and ignore the others. So, all of the vertex points have two states. They are either part of the final simplified polyline or not. The difference between algorithms is in the method of accepting and ignoring vertex points. This paper introduces a new method in which all of the points accompany in making the final simplified polyline. The result in this method is unique and even for polygons it gives a unique result. It is also faster than other methods and is flexible enough to let the vertex points of original polyline have weights in shaping the final result
关键词：polyline; simplification; cartography; algorithm; optimization; small scale
