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

Standard

Line generalisation by repeated elimination of points. / Visvalingam, M.; Whyatt, J. D.
In: Cartographic Journal, Vol. 30, No. 1, 01.01.1993, p. 46-51.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Visvalingam, M & Whyatt, JD 1993, 'Line generalisation by repeated elimination of points', Cartographic Journal, vol. 30, no. 1, pp. 46-51. https://doi.org/10.1179/000870493786962263

APA

Vancouver

Visvalingam M, Whyatt JD. Line generalisation by repeated elimination of points. Cartographic Journal. 1993 Jan 1;30(1):46-51. doi: 10.1179/000870493786962263

Author

Visvalingam, M. ; Whyatt, J. D. / Line generalisation by repeated elimination of points. In: Cartographic Journal. 1993 ; Vol. 30, No. 1. pp. 46-51.

Bibtex

@article{bb537b9658fe475da15ecd6a8765c6d9,
title = "Line generalisation by repeated elimination of points",
abstract = "This paper presents a new approach to line generalisation which uses the concept of {\textquoteleft}effective area{\textquoteright} 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.",
author = "M. Visvalingam and Whyatt, {J. D.}",
year = "1993",
month = jan,
day = "1",
doi = "10.1179/000870493786962263",
language = "English",
volume = "30",
pages = "46--51",
journal = "Cartographic Journal",
issn = "0008-7041",
publisher = "Maney Publishing",
number = "1",

}

RIS

TY - JOUR

T1 - Line generalisation by repeated elimination of points

AU - Visvalingam, M.

AU - Whyatt, J. D.

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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.

AB - 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.

U2 - 10.1179/000870493786962263

DO - 10.1179/000870493786962263

M3 - Journal article

AN - SCOPUS:0027877110

VL - 30

SP - 46

EP - 51

JO - Cartographic Journal

JF - Cartographic Journal

SN - 0008-7041

IS - 1

ER -