Robustness in GIS algorithm implementation with application to line simplification

$61.74 plus tax (Refund Policy)

Buy Article:

Abstract:

The sensitivity of computed results to implementations of algorithms in GIS is considered in this paper on the example of a precisely defined recursive variant of the Ramer-Douglas-Peucker line simplification algorithm (called the R-D-P algorithm). We establish a robust version of the R-D-P algorithm where the determination of the simplification is rounding error free if the data are already machine numbers. Under these assumptions, the results are reproducible which is not the case with other versions of the algorithm.

Document Type: Research Article

DOI: http://dx.doi.org/10.1080/13658810110053107

Publication date: December 1, 2001

More about this publication?
Related content

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more