## RDP Algorithm

Coding Challenge #152

The Ramer–Douglas–Peucker algorithm (aka “iterative end-point fit algorithm”), takes a curve composed of line segments and reduces the fidelty to a “lower fidelity” curve with fewer points.

### Community Contributions

- Ramer–Douglas–Peucker algorithm in 3D using p5.js
*by Miká Kruschel*(Source Code) - Ramer–Douglas–Peucker of GPS Route Data Swift 5 for iPhone
*by Michael Macewich* - perform RDP on path for fourier drawing
*by David Snyder*(Source Code) - RDP scaling fidelity to plot Y-axis lines
*by Motus Art (Owen)*(Source Code) - Draw, Reduce, Make Curves
*by Ignotus El Mago*(Source Code) - RDP Line Simplification in Python with matplotlib
*by Thomas Povinelli*(Source Code)

You can also add your own version! (See how)

### Links discussed in this coding challenge

### Videos discussed in this coding challenge

- Challenge #128: Sketch-RNN Snowflakes
*by The Coding Train* - Live Stream #185
*by The Coding Train*