The Ramer-Douglas-Peucker algorithm, also known as the Douglas-Peucker algorithm and the iterative end-point fit algorithm, decimates a curve composed of line segments into a similar curve with fewer points. It was one of the earliest successful algorithms developed for cartographic generalization, and while it produces the most accurate generalization among such methods, it is also more time-consuming.
Facts
Time Complexity
Time Complexity (category)Quadratic Time -- O(n^2) 1 Connections
In Field
Source Ramer-Douglas-Peucker algorithm (Wikipedia)
Sources
1. Ramer-Douglas-Peucker algorithm (Wikipedia)
Wikipedia article body, read for Browse By backfill (w-bbfill-computing6-0927)
Ramer-Douglas-Peucker algorithm (Wikipedia)
In Field: Algorithms and Complexity Theory, Lead sentence
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.
In Group: Curve Simplification and Smoothing Algorithms, Lead
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.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.