Zhao-Saalfeld ( Line Simplification): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(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")
 
No edit summary
 
Line 23: Line 23:
== Model of Computation ==  
== Model of Computation ==  


 
Real RAM


== Year ==  
== Year ==  

Latest revision as of 07:54, 10 April 2023

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