Ramer–Douglas–Peucker algorithm ( Line Simplification)
Revision as of 10:33, 15 February 2023 by Admin (talk | contribs) (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")
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