A Growing Bezier Curve for Efficient Curve Approximation

A curve approximation technique, based on growing quadratic and cubic Bezier, is presented in this paper. The approximating curve starts growing along the given curve till it reaches to the end. It determines the suitable location of control points in its way. Some important features of proposed algorithm, that distinguish it from previous approaches, may include use of standard Bezier curves, efficient computation of approximating curve by exploiting the properties of Bezier curves, efficient method of calculating the approximation error, and incremental growth of curve. Results of proposed algorithm are compared with different approaches in terms of compression ratio, approximation error, and computation efficiency. Proposed algorithm can lead to various applications in computer aided design, computational geometry, and computer vision.