A Prototype for linear features generalization

Abstract

A computer application designed to generalize linear elements in a vector formatted cartographic set by means of two of the most contrasted line generalization algorithms, Douglas-Peucker simplification and Bézier curves based smoothing, is presented in this paper. Regarding codification, the simultaneous treatment of different lineal geometry entity classes and the conservation of their original topological relationships among them are considered. It is recommended in processes that produce small scale reductions (in a 1:2 relationship or similar). The application allows changing the characteristic parameters of the referred algorithms and proposes a report of the results obtained after every transformation. That way it supplies an additional facility as a trial tool to choose the parameters that give the best results in every process.