Zhao-Saalfeld ( Line Simplification)
Revision as of 11:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ (Derived: There is an auxiliary sleeve set that is $O(n)$ size worst-case) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference == http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.494.7321")
Time Complexity
$O(n)$
Space Complexity
$O(n)$
(Derived: There is an auxiliary sleeve set that is $O(n)$ size worst-case)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1997
Reference
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.494.7321