1993
DOI: 10.1179/000870493786962263
|View full text |Cite
|
Sign up to set email alerts
|

Line generalisation by repeated elimination of points

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
81
0

Year Published

1997
1997
2021
2021

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 132 publications
(81 citation statements)
references
References 7 publications
0
81
0
Order By: Relevance
“…The 'hand-drawn' or 'sketchy' effect on the polygons has been achieved by a combination of polygon smoothing, line smoothing, multiple-overlay and image composite operations in order to give the impression that they have been drawn using felt-tip pens (akin to the approach first suggested by Ashton, 2012). Conversely, the line features were simplified using the Visvalingam-Whyatt line generalisation algorithm (Visvalingam and Whyatt, 1993), and overlaid using transparency and image composite operations in order to give the appearance of having been drawn using highlighter pens. The main difference with this approach is that the level of abstraction varies from feature to feature as opposed to being uniform across the dataset as is the case in the grid-based approaches, which may prove more disorientating for users.…”
Section: Encourage Players To Navigate 'Head-up' Rather Than 'Head-domentioning
confidence: 99%
“…The 'hand-drawn' or 'sketchy' effect on the polygons has been achieved by a combination of polygon smoothing, line smoothing, multiple-overlay and image composite operations in order to give the impression that they have been drawn using felt-tip pens (akin to the approach first suggested by Ashton, 2012). Conversely, the line features were simplified using the Visvalingam-Whyatt line generalisation algorithm (Visvalingam and Whyatt, 1993), and overlaid using transparency and image composite operations in order to give the appearance of having been drawn using highlighter pens. The main difference with this approach is that the level of abstraction varies from feature to feature as opposed to being uniform across the dataset as is the case in the grid-based approaches, which may prove more disorientating for users.…”
Section: Encourage Players To Navigate 'Head-up' Rather Than 'Head-domentioning
confidence: 99%
“…Note that the distance along a coastline will depend on the precision of the coastline representation, with higher precisions generating longer distances. There were 74032 vertices in the constructed shape map, so a global simplification algorithm [35] was used to simplify the map down to a 500 vertex coastline map (Figure 3). The coastline is represented by a straight line segment drawn between each pair of vertices.…”
Section: Generation Of Daily Cloudinessmentioning
confidence: 99%
“…A number of polygon simplification algorithms have been developed in digital cartography for map generalization [5], such as the Douglas-Peucker algorithm [6], the Visvalingam-Whyatt algorithm [7], and the bend-simplify algorithm [8]. None of these algorithms, however, satisfies one critical requirement for mappings used in LBS applications: the simplified polygon should be fully enclosed in the original polygon so that the simplified polygon should never produce false positives.…”
Section: Introductionmentioning
confidence: 99%