Reumann–Witkam ( Line Simplification)

From Algorithm Wiki

Revision as of 08: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)$

Space Complexity

$O({1})$

(Derived: The only auxiliary space used is the current search line and the distance from the next point to the line.)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1974

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Reumann–Witkam_(_Line_Simplification)&oldid=46937"