Pretty fast implementation of the Ramer-Douglas-Peucker algorithm for reducing the number of points on a 2D curve. Urs Ramer (1972), "An iterative procedure for the polygonal approximation of plane curves" <doi:10.1016/S0146-664X(72)80017-0>. David H. Douglas and Thomas K. Peucker (1973), "Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature" <doi:10.3138/FM57-6770-U75U-7727>.
Version: | 0.3.0 |
Imports: | Rcpp |
LinkingTo: | Rcpp |
Suggests: | testthat, withr, zeallot |
Published: | 2023-07-05 |
DOI: | 10.32614/CRAN.package.RDP |
Author: | Robert Dahl Jacobsen [aut, cre] |
Maintainer: | Robert Dahl Jacobsen <cran at dahl-jacobsen.dk> |
License: | GPL-3 |
URL: | https://github.com/robertdj/RDP |
NeedsCompilation: | yes |
CRAN checks: | RDP results |
Reference manual: | RDP.pdf |
Package source: | RDP_0.3.0.tar.gz |
Windows binaries: | r-devel: RDP_0.3.0.zip, r-release: RDP_0.3.0.zip, r-oldrel: RDP_0.3.0.zip |
macOS binaries: | r-release (arm64): RDP_0.3.0.tgz, r-oldrel (arm64): RDP_0.3.0.tgz, r-release (x86_64): RDP_0.3.0.tgz, r-oldrel (x86_64): RDP_0.3.0.tgz |
Old sources: | RDP archive |
Please use the canonical form https://CRAN.R-project.org/package=RDP to link to this page.