Acta Geodaetica et Cartographica Sinica ›› 2017, Vol. 46 ›› Issue (4): 498-506.doi: 10.11947/j.AGCS.2017.20160546

Previous Articles     Next Articles

A Line Simplification Algorithm Considering Spatial Relations between Two Lines

LI Chengming1,2, GUO Peipei1,2, YIN Yong1,2, WU Pengda2, GU Teng3   

  1. 1. College of Geomatics, Shandong University of Science and Technology, Qingdao 266590, China;
    2. Chinese Academy of Surveying and Mapping, Beijing 100830, China;
    3. School of Geomatics, East China University of Tecnology, Nanchang 330013, China
  • Received:2016-10-31 Revised:2017-03-27 Online:2017-04-20 Published:2017-05-05

Abstract: Line element simplification has always been a hot research topic in the field of cartography generalization and expression. However, more existing line simplification algorithms aimed at single line rather than spatial relationship between linear elements. At the same time, there are some problems with classical algorithm, such as blunt performance(D-P algorithm), missing local extreme point and curve intersection(L-O algorithm). So, this paper puts forward a line simplification algorithm taking account of spatial relations between two lines. Line global simplification method(LGSM), vector displacement, area displacement and so on are proposed. Experiments are carried out on three kinds of line elements,such as contour lines, rivers and roads. The experiments' results show that the proposed algorithm can maintain the overall shape of the curve better and reduce the complexity of the curve effectively, the shape is more smooth and has a high position accuracy.

Key words: line simplification, spatial relations constraints, line global simplification method(LGSM), square-root model

CLC Number: