Visvalingam–Whyatt ( Line Simplification)

From Algorithm Wiki

Revision as of 07:54, 10 April 2023 by Admin (talk | contribs)

(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

Real RAM

Year

1993

Reference

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Visvalingam–Whyatt_(_Line_Simplification)&oldid=46936"