An Experimental Comparison of Line Generalization Algorithms in GIS

Younis Saida Saeedrashed


During the process of "Digitizing" which requires execute of huge amount of sequential vertices and segments for creating layers that are in vector base, cartographers face two main problems which are; the quality of presented data and the file size. Despite that the process of line generalization is a superior solution to overcome these two problems, it produces errors such as spike, line-crossing, line-coincident, and polygon knot in the topological structures of lines being generalized. Geometric data that have complex topological structure can be simplified and smoothed by applying four types of techniques based algorithms, which are; Nth Point, Jenks, Point Remove, and Bend Simplify. In this paper, through an experimental comparison study, it is proved that the bend simplify algorithm is the best approach amongst four types of algorithms applied to line generalization that preserves the quality of the line being generalized and reduce the file size moderately.


Geographical Information Systems (GIS); Algorithms; Line Generalization

Full Text: PDF


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

*2016 Journal Impact Factor was established by dividing the number of articles published in 2014 and 2015 with the number of times they are cited in 2016 based on Google Scholar, Google Search and the Microsoft Academic Search. If ‘A’ is the total number of articles published in 2014 and 2015, and ‘B’ is the number of times these articles were cited in indexed publications during 2016 then, journal impact factor = A/B. To know More: (