Home > Research > Publications & Outputs > Line generalisation by repeated elimination of ...

Links

Text available via DOI:

View graph of relations

Line generalisation by repeated elimination of points

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
<mark>Journal publication date</mark>1/01/1993
<mark>Journal</mark>Cartographic Journal
Issue number1
Volume30
Number of pages6
Pages (from-to)46-51
Publication StatusPublished
<mark>Original language</mark>English

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 lines. It is capable of achieving both imperceptible minimal simplifications and caricatural generalisations. By careful selection of cutoff values, it is possible to use the same algorithm for 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.