Visvalingam–Whyatt ( Line Simplification)

From Algorithm Wiki
Revision as of 11:34, 15 February 2023 by Admin (talk | contribs) (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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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