Skip to main content

Robustness in GIS algorithm implementation with application to line simplification

Buy Article:

$55.00 plus tax (Refund Policy)

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.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Document Type: Research Article

Publication date: 2001-12-01

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect 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