@article { , title = {Simplification and generalization of large scale data for roads : a comparison of two filtering algorithms}, abstract = {This paper reports the results of an in-depth study which investigated two algorithms for line simplification and caricatural generalization (namely, those developed by Douglas and Peucker, and Visvalingam, respectively) in the context of a wider program of research on scale-free mapping. The use of large-scale data for man-designed objects, such as roads, has led to a better understanding of the properties of these algorithms and of their value within the spectrum of scale-free mapping. The Douglas-Peucker algorithm is better at minimal simplification. The large-scale data for roads makes it apparent that Visvalingam's technique is not only capable of removing entire scale-related features, but that it does so in a manner which preserves the shape of retained features. This technique offers some prospects for the construction of scale-free databases since it offers some scope for achieving balanced generalizations of an entire map, consisting of several complex lines. The results also suggest that it may be easier to formulate concepts and strategies for automatic segmentation of in-line features using large-scale road data and Visvalingam's algorithm. In addition, the abstraction of center lines may be facilitated by the inclusion of additional filtering rules with Visvalingam's algorithm.}, doi = {10.1559/152304095782540249}, eissn = {1545-0465}, issn = {1523-0406}, issue = {4}, journal = {Cartography and geographic information systems}, pages = {264-275}, publicationstatus = {Published}, publisher = {Taylor and Francis}, url = {https://hull-repository.worktribe.com/output/442105}, volume = {22}, keyword = {Line simplification, Line generalization, Roads, Large scales}, year = {1995}, author = {Visvalingam, Maheswari and Williamson, Peter J.} }