Zhao-Saalfeld ( Line Simplification)

From Algorithm Wiki
Jump to navigation Jump to search

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

Real RAM

Year

1997

Reference

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.494.7321