Visvalingam–Whyatt ( Line Simplification): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ (Derived: Storing each points effective area) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1993 == Reference == https://hull-repository.worktribe.com/output/459275")
 
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^{2})$

Space Complexity

$O(n)$

(Derived: Storing each points effective area)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1993

Reference

https://hull-repository.worktribe.com/output/459275