Python/Numpy implementation of the Ramer-Douglas-Peucker algorithm
Simplify geometry using the Ramer–Douglas–Peucker algorithm.
RDP implementation in C++
A java implementation of Ramer–Douglas–Peucker algorithm for reducing number of points in data series.
An algorithm that decimates a curve composed of line segments to a similar curve with fewer points.
A fast Ramer-Douglas-Peucker algorithm implementation.
apply the ramer-douglas-peucker line simplification to geojson features or feature collections in JS or on the CLI
PHP implementation of the Ramer–Douglas–Peucker algorithm for polyline simplification
Ramer-Douglas–Peucker algorithm in golang
C++ implementation of Ramer–Douglas–Peucker algorithm
Ramer-Douglas-Peucker path simplification algorithm in Golang
C implementation of the Ramer-Douglas-Peucker algorithm.
Ramer-Douglas-Peucker algorithm for 2D data in C#
Simplify GeoJSON geometry using the Ramer–Douglas–Peucker algorithm
A C implementation of the Ramer-Douglas-Peucker path simplification algorithm
Demo for nifty geometric algorithms (Even-Odd, and Ramer-Douglas-Peucker)
JavaScript module to simplify lines (polygons) using the Ramer–Douglas–Peucker algorithm
simpleline is a Golang package simplifies N dimensional lines using the Ramer–Douglas–Peucker algorithm
[C++ (Qt), Computational geometry] Visualisation of Ramer-Douglas-Peucker and Visvalingam-Whyatt algorithms for simplifying polygons
Optimize GPX track using Python by fixing altitude (SRTM), deleting bitten segments and reducing number of points using Ramer–Douglas–Peucker algorithm.