Polygonal path approximation with angle constraints
Danny Z. Chen, Ovidiu Daescu, John E. Hershberger, Peter Michael Kogge, Jack Scott Snoeyink · 2001
Introduction We consider the following problem of approximating a polygonal path with angle constraints: Given a polygonal path P = (p 1 ; p 2 ; : : : ; p n ) in a xed d-D space (d 2), nd a path P 0 = (p i 1 ; p i 2 ; : : : ; p i m ), such that for each j 2 f1; 2; : : : ; mg, (1) i j 2 f1; 2; : : : ; ng, (2) i j < i j+1 , (3) the subpath (p i j ; p i j +1 ; : : : ; p i j+1 ) of P is entirely contained in the error-tolerance zone of the segment p i