🔗 Smoothening complex polygons - Ramer–Douglas–Peucker algorithm
The Ramer–Douglas–Peucker algorithm, also known as the Douglas–Peucker algorithm and iterative end-point fit algorithm, is an algorithm that decimates a curve composed of line segments to a similar curve with fewer points.
Discussed on
- "Smoothening complex polygons - Ramer–Douglas–Peucker algorithm" | 2010-12-23 | 30 Upvotes 14 Comments