View source for Opheim simplification ( Line Simplification)

== 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