The Geometric Properties of Numerical Generalization

Research output: Contribution to journalArticle

36 Citations (Scopus)

Abstract

Over the past twenty years, cartographers have become increasingly concerned with the nature and quality of cartographic data in digital format. One significant area of research has been in the generalization of these digital data. Specifically, algorithms have been developed to (1) weed out unnecessary detail, (2) smooth sharp angularity, (3) displace two features coalescing due to scale change, and (4) enhance certain characteristics of the data. This paper presents an analysis of nine algorithms developed for simplifying the superfluous detail in digital cartographic lines. A series of geometric measures were designed to evaluate the changes produced by simplification. These included both single attribute measures, which evaluate changes such as line length and angularity, and displacement measures, which evaluate geometric displacement such as area. The results of this analysis, using four digitized naturally occurring lines and their simplifications, indicates that four algorithms: DOUGLAS, OPHEIM, REUMANN, and LANG are mathematically superior. Although the Douglas routine was slightly better—in terms of area displacement—than the other three, it is the most computationally complex algorithm. Thus for certain mapping tasks, such as in thematic cartography, other routines such as LANG tolerancing appear more appropriate. 1987 The Ohio State University

Original languageEnglish (US)
Pages (from-to)330-346
Number of pages17
JournalGeographical Analysis
Volume19
Issue number4
DOIs
StatePublished - Jan 1 1987
Externally publishedYes

Fingerprint

cartography
weed
analysis
attribute

Cite this

The Geometric Properties of Numerical Generalization. / Mc Master, Robert B.

In: Geographical Analysis, Vol. 19, No. 4, 01.01.1987, p. 330-346.

Research output: Contribution to journalArticle

@article{844d3bca77b84b29a6e9684d2dc59bd4,
title = "The Geometric Properties of Numerical Generalization",
abstract = "Over the past twenty years, cartographers have become increasingly concerned with the nature and quality of cartographic data in digital format. One significant area of research has been in the generalization of these digital data. Specifically, algorithms have been developed to (1) weed out unnecessary detail, (2) smooth sharp angularity, (3) displace two features coalescing due to scale change, and (4) enhance certain characteristics of the data. This paper presents an analysis of nine algorithms developed for simplifying the superfluous detail in digital cartographic lines. A series of geometric measures were designed to evaluate the changes produced by simplification. These included both single attribute measures, which evaluate changes such as line length and angularity, and displacement measures, which evaluate geometric displacement such as area. The results of this analysis, using four digitized naturally occurring lines and their simplifications, indicates that four algorithms: DOUGLAS, OPHEIM, REUMANN, and LANG are mathematically superior. Although the Douglas routine was slightly better—in terms of area displacement—than the other three, it is the most computationally complex algorithm. Thus for certain mapping tasks, such as in thematic cartography, other routines such as LANG tolerancing appear more appropriate. 1987 The Ohio State University",
author = "{Mc Master}, {Robert B}",
year = "1987",
month = "1",
day = "1",
doi = "10.1111/j.1538-4632.1987.tb00134.x",
language = "English (US)",
volume = "19",
pages = "330--346",
journal = "Geographical Analysis",
issn = "0016-7363",
publisher = "Wiley-Blackwell",
number = "4",

}

TY - JOUR

T1 - The Geometric Properties of Numerical Generalization

AU - Mc Master, Robert B

PY - 1987/1/1

Y1 - 1987/1/1

N2 - Over the past twenty years, cartographers have become increasingly concerned with the nature and quality of cartographic data in digital format. One significant area of research has been in the generalization of these digital data. Specifically, algorithms have been developed to (1) weed out unnecessary detail, (2) smooth sharp angularity, (3) displace two features coalescing due to scale change, and (4) enhance certain characteristics of the data. This paper presents an analysis of nine algorithms developed for simplifying the superfluous detail in digital cartographic lines. A series of geometric measures were designed to evaluate the changes produced by simplification. These included both single attribute measures, which evaluate changes such as line length and angularity, and displacement measures, which evaluate geometric displacement such as area. The results of this analysis, using four digitized naturally occurring lines and their simplifications, indicates that four algorithms: DOUGLAS, OPHEIM, REUMANN, and LANG are mathematically superior. Although the Douglas routine was slightly better—in terms of area displacement—than the other three, it is the most computationally complex algorithm. Thus for certain mapping tasks, such as in thematic cartography, other routines such as LANG tolerancing appear more appropriate. 1987 The Ohio State University

AB - Over the past twenty years, cartographers have become increasingly concerned with the nature and quality of cartographic data in digital format. One significant area of research has been in the generalization of these digital data. Specifically, algorithms have been developed to (1) weed out unnecessary detail, (2) smooth sharp angularity, (3) displace two features coalescing due to scale change, and (4) enhance certain characteristics of the data. This paper presents an analysis of nine algorithms developed for simplifying the superfluous detail in digital cartographic lines. A series of geometric measures were designed to evaluate the changes produced by simplification. These included both single attribute measures, which evaluate changes such as line length and angularity, and displacement measures, which evaluate geometric displacement such as area. The results of this analysis, using four digitized naturally occurring lines and their simplifications, indicates that four algorithms: DOUGLAS, OPHEIM, REUMANN, and LANG are mathematically superior. Although the Douglas routine was slightly better—in terms of area displacement—than the other three, it is the most computationally complex algorithm. Thus for certain mapping tasks, such as in thematic cartography, other routines such as LANG tolerancing appear more appropriate. 1987 The Ohio State University

UR - http://www.scopus.com/inward/record.url?scp=0023468593&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023468593&partnerID=8YFLogxK

U2 - 10.1111/j.1538-4632.1987.tb00134.x

DO - 10.1111/j.1538-4632.1987.tb00134.x

M3 - Article

VL - 19

SP - 330

EP - 346

JO - Geographical Analysis

JF - Geographical Analysis

SN - 0016-7363

IS - 4

ER -