Robustness in GIS algorithm implementation with application to line simplification

Citation
H. Ratschek et al., Robustness in GIS algorithm implementation with application to line simplification, INT J GEO I, 15(8), 2001, pp. 707-720
Citations number
28
Categorie Soggetti
EnvirnmentalStudies Geografy & Development
Journal title
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE
ISSN journal
13658816 → ACNP
Volume
15
Issue
8
Year of publication
2001
Pages
707 - 720
Database
ISI
SICI code
1365-8816(200112)15:8<707:RIGAIW>2.0.ZU;2-6
Abstract
The sensitivity of computed results to implementations of algorithms in GIS is considered in this paper on the example of a precisely defined recursiv e variant of the Ramer-Douglas-Peucker line simplification algorithm (calle d the R-D-P algorithm). We establish a robust version of the R-D-P algorith m where the determination of the simplification is rounding error free if t he data are already machine numbers. Under these assumptions, the results a re reproducible which is not the case with other versions of the algorithm.