Ramer–Douglas–Peucker algorithm

Ramer–Douglas–Peucker algorithm

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

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 developed for cartographic generalization.

Excerpt from the Wikipedia article “Ramer–Douglas–Peucker algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Ramer–Douglas–Peucker algorithm to your collection.

Play for free

Related cards