Content deleted Content added
Kenneth Kho (talk | contribs) Better reflect the abstract of the source itself, also supported by the significant "Performance Evaluation of Line Simplification Algorithms for Vector Generalization" by Wenzhong Shi and ChuiKwan Cheung (2006) |
Kenneth Kho (talk | contribs) See the application section below, as well as the abstract and the third paragraph of the first source in it |
||
Line 1:
{{Short description|Curve simplification algorithm}}
The '''Ramer–Douglas–Peucker algorithm''', also known as the '''Douglas–Peucker algorithm''' and '''iterative end-point fit algorithm''', is an algorithm that [[Decimation (signal processing)|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]] as it delivers the best perceptual representations of the original lines.
== Idea ==
| |||