Line generalisation by repeated elimination of the smallest area

Visvalingam, Maheswari; Whyatt, James Duncan

Abstract

This paper presents a new approach to line generalisation which uses the concept of "effective area " for progressive simplification of a line by point elimination. Two coastlines are used to compare the performance of this, with that of the widely used Douglas-Peucker, algorithm. The results from the area-based algorithm compare favourably with manual generalisation of the same simplifications
and caricatural generalisations. By careful selection of cut - off values , it is possible to use the same algorithm for both scale -dependent and scale -independent generalisations. More importantly, it offers scope for modelling cartographic lines as consisting of features within features so that their geometric manipulation may be modified by application - and/or user - defined rules and weights . The paper examines the merits and limitations of the algorithm and the opportunities it offers for further research and progress in
the field of line generalisation .

Citation

Visvalingam, M., & Whyatt, J. D. Line generalisation by repeated elimination of the smallest area

• Working Paper Type: Discussion Paper
• Deposit Date: Mar 7, 2014
• Pages: 20
• Series Title: C.I.S.R.G. Discussion Papers (University of Hull Cartographic Information Systems Research Group)
• Series Number: 10
• Book Title: Line generalisation by repeated elimination of the smallest area
• Keywords: Cartography -- Data processing, Computer science
• Public URL: https://hull-repository.worktribe.com/output/459275