Advertisement

Coding Challenge #152: RDP Line Simplification Algorithm

Coding Challenge #152: RDP Line Simplification Algorithm 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.

💻
💻

🔗 Ramer-Douglas-Peucker Algorithm on Wikipedia:
🔗 Nature of Code:

🎥 Challenge #128: Sketch-RNN Snowflakes:
🎥 Live Stream:

🚂 Website:
💖 Patreon:
🛒 Store:
📚 Books:

🎥 Coding Challenges:
🎥 Intro to Programming:

🔗 p5.js:
🔗 Processing:

Algorithm

Post a Comment

0 Comments