Opheim simplification ( Line Simplification)

From Algorithm Wiki
Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ (Derived: The only auxiliary space used is the current search ray and the current best, the distances from the next point to the ray and to the ray's origin, candidate point to stay in the simplified line) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1981 == Reference == http://dx.doi.org.ezproxy.canberra.edu.au/10.2312/eg.19811012")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O({1})$

(Derived: The only auxiliary space used is the current search ray and the current best, the distances from the next point to the ray and to the ray's origin, candidate point to stay in the simplified line)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1981

Reference

http://dx.doi.org.ezproxy.canberra.edu.au/10.2312/eg.19811012

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