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.
Challenges
Featured Challenge:
#163 — Bézier Curves
Have you ever wanted to know more about bézier curves in p5.js? Thanks to a generous donation from Jason Oswald, I do a deep dive exploring the bézier curve function and the math behind the algorithm?
Filter by Language
Pick a language to filter
Filter by Topic
Ramer-Douglas-Peucker algorithm