1987
DOI: 10.1111/j.1538-4632.1987.tb00134.x
|View full text |Cite
|
Sign up to set email alerts
|

The Geometric Properties of Numerical Generalization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

1991
1991
2012
2012

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 43 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…In all of these studies, computational algorithms were developed and implemented to perform map transformations, create cartograms, or generate Thiessen polygons (e.g., Sen ; Mark ). This remained an active area of research in quantitative geography throughout the 40 years, as evidenced by more recent contributions to GA about cartographic generalization and spatial interpolation (e.g., McMaster ; Cromley and Campbell ; Cramer and Armstrong ; Feick and Boots ).…”
Section: Gismentioning
confidence: 99%
“…In all of these studies, computational algorithms were developed and implemented to perform map transformations, create cartograms, or generate Thiessen polygons (e.g., Sen ; Mark ). This remained an active area of research in quantitative geography throughout the 40 years, as evidenced by more recent contributions to GA about cartographic generalization and spatial interpolation (e.g., McMaster ; Cromley and Campbell ; Cramer and Armstrong ; Feick and Boots ).…”
Section: Gismentioning
confidence: 99%
“…McMaster (1987) classifies them into five categories: (1) Independent point algorithms, (2) local processing algorithms, (3) Unconstrained extended local processing algorithms, (4) constrained extended local processing algorithms and (5) global processing algorithms. The first four types of algorithms belong to Local line simplification algorithms, and the last-to the Global line simplification algorithms .…”
Section: Introductionmentioning
confidence: 99%
“…This distance is further measured using various metrics including Hausdorff distance for L 1 , L 2 or L ∞ metrics [3,8,9,14,17,21] and Fréchet distance [4,10]. In area-distortion, the error of a simplification is defined as a function of the area created between the initial and the simplification paths [5,18,19,23,24].…”
Section: Introductionmentioning
confidence: 99%