Author： Ratschek H. Rokne J. Leriger M.
Publisher： Taylor & Francis Ltd
ISSN： 1365-8824
Source： International Journal of Geographical Information Science, Vol.15, Iss.8, 2001-12, pp. : 707-720
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
By Poliyapram Vinayaraj Raghavan Venkatesh Metz Markus Delucchi Luca Masumoto Shinji
ISPRS International Journal of Geo-Information, Vol. 6, Iss. 3, 2017-03 ,pp. :
Access to resources
Recommend
Access to resources