Reumann–Witkam ( Line Simplification)
Jump to navigation
Jump to search
Time Complexity
$O(n)$
Space Complexity
$O({1})$
(Derived: The only auxiliary space used is the current search line and the distance from the next point to the line.)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1974