An Efficient Variable-Step Algorithm for Bezier Curves

In computer drawing, Bézier curves have gained extensive applications in many fields because of its easiness on compute and stability. Generally, traditional generating algorithms on Bézier curves are point-by-point generating algorithms. To draw genuine curve and reduce computational costs as much as possible, curve-generating point-by-point has been studied in many papers, some good results have been achieved. But common generating algorithms of Bézier curves have lower efficiency. The selection of step size parameter has great impacts on the accuracy and efficiency of generating curves. In view of the generating algorithm insufficiency for Bézier curve, we present a variable step generating algorithm. By changing step size parameter, the algorithm significantly reduced the calculation of a large number of duplicate points. It not only maintained a high accuracy, but also significantly reduced a large number of repeat points. It increased the curves generated efficiency and has a better application value.