Ramer–Douglas–Peucker algorithm ( Line Simplification): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$? (Derived: Recursive algorithm that has a worst-case recursion tree depth of O(n)?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1972 == Reference == https://www.sciencedirect.com/science/article/abs/pii/S0146664X72800170") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$ | $O(n)$ | ||
(Derived: Recursive algorithm that has a worst-case recursion tree depth of O(n) | (Derived: Recursive algorithm that has a worst-case recursion tree depth of O(n), and O(1) info stored per level) | ||
== Description == | == Description == | ||
| Line 23: | Line 23: | ||
== Model of Computation == | == Model of Computation == | ||
Real RAM | |||
== Year == | == Year == | ||
Latest revision as of 07:54, 10 April 2023
Time Complexity
$O(n^{2})$
Space Complexity
$O(n)$
(Derived: Recursive algorithm that has a worst-case recursion tree depth of O(n), and O(1) info stored per level)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1972
Reference
https://www.sciencedirect.com/science/article/abs/pii/S0146664X72800170