Bisection algorithms for approximating quadratic Bezier curves by G(1) are splines
To describe the tool path of a CNC machine, it is often necessary to approximate curves by G(1) arc splines with the number of are segments as small as possible. Ahn et al. have proposed an iterative algorithm for approximating quadratic Bezier curves by G(1) are splines with fewer are segments than the biarc method. This paper gives the formula of the upper bound for are segments used by their algorithm. Based on the formula, two kinds of bisection algorithms for approximating quadratic Bezier curves by G(1) arc splines are presented. Results of some examples illustrate their efficiency. (C) 2000 Elsevier Science Ltd. All rights reserved.
bisection algorithms quadratic bezier curves cnc arc splines