Anonymous user
Ramer-Douglas-Peucker line simplification: Difference between revisions
Ramer-Douglas-Peucker line simplification (view source)
Revision as of 09:04, 15 September 2018
, 5 years agoadded whitespace and highlighting to the task's preamble, elided a stray comma.
m (→{{header|REXX}}: corrected spelling of the name: Peucker.) |
m (added whitespace and highlighting to the task's preamble, elided a stray comma.) |
||
Line 1:
[[Category:Geometry]]
[[Category:Recursion]]
{{task}}Ramer–Douglas–Peucker algorithm is a line simplification algorithm for reducing the number of points used to define its shape.<ref>[https://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm]</ref>▼
{{task}}
▲
;Task:
Using the '''Ramer–Douglas–Peucker''' algorithm, simplify the 2D line defined by the points:
(0,0) (1,0.1) (2,-0.1) (3,5) (4,6) (5,7) (6,8.1) (7,9) (8,9) (9,9)
The error threshold to use is: '''1.0'''.
Display the remaining points.
<br><br>
=={{header|C++}}==
| |||