Polygonal chain simplification with small angle constraints
Ovidiu Daescu, Anastasia Kurdia · 2008
We consider the problem of simplifying an n-vertex polygonal chain with small angle constraints in R2 and R3, thus closing the gap on the range of angles left in previous work on the problem. Specifically, we show that the min- # version of the polygonal chain simplification problem with small angle constraints can be solved in O(n 2) time and space in R 2, and in O(n 2 log 2 n) time, O(n 2) space in R 3. p 1