Reumann–Witkam ( Line Simplification)
Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == == Year == 1974 == Reference ==")
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
Year
1974