Assessment of Line-Generalization Algorithms Using Characteristic Points

Abstract

Line generalization, used to reduce scale in mapping, caricatures an original line by retaining points essential to its shape—called characteristic, or critical, points—and discarding others. This study describes experiments utilizing base lines of perceptually selected critical points to evaluate three common line-generalization algorithms: nth-point elimination, a perpendicular routine, and the Douglas algorithm. Base-line correspondence to computer generalizations was measured by graphical overlay, areal offset, commonly held points, and mean number of times respondents judged particular points to be critical. Visual comparison of an original line and its computer generalization followed. The Douglas algorithm's line generalizations proved more faithful to original lines than those of perpendicular point selection and nth-point elimination.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 101 citations exist upstream.