RDP

CRANRDPMaRDI QIDQ112948

The Ramer-Douglas-Peucker Algorithm

Robert Dahl Jacobsen

Last update: 5 July 2023

Software version identifier: 0.2.3, 0.1.4, 0.1.5, 0.1.6, 0.1.7, 0.1.8, 0.2.0, 0.3.0

Copyright license: GNU General Public License, version 3.0

Description

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>.

Cites work

• An iterative procedure for the polygonal approximation of plane curves
• ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE