Saved
orangecrumbs
Weekly digest

Get new Wikipedia articles popular on Hacker News - one email per week.

No spam. Unsubscribe anytime. · Privacy

You're in! First issue lands soon.
Full article HN thread
Smoothening complex polygons - Ramer–Douglas–Peucker algorithm

Smoothening complex polygons - Ramer–Douglas–Peucker algorithm

▲ 30 💬 14

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. It was one of the earliest successful algorithms…

No articles match these filters.
Loosen the topics or points filter.
HN ↗
Loading comments…
Smoothening complex polygons - Ramer–Douglas–Peucker algorithm

Smoothening complex polygons - Ramer–Douglas–Peucker algorithm

▲ 30💬 14

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. It was one of the earliest successful algorithms…

Open on HN ↗
Loading comments…
Weekly digest

Get new Wikipedia articles popular on Hacker News - one email per week.

No spam. Unsubscribe anytime. · Privacy

You're in! First issue lands soon.

Sort & filter

Sort
🔀 Shuffle
▲ Most points
🕑 New
💬 Most discussed
Points
All
50+
100+
150+
Topics