Efficient Handwritten Curve Approximation by a Bezier Curve Using Chebyshev Polynomials

This paper presents two methodologies for approximating a handwritten curve by a Bézier curve using Chebyshev Polynomials. First, two different featured point selection techniques, are introduced in algorithms 1 and 2. Algorithm 1 uses frequency while algorithm 2 uses the analysis of inflection point. Then, using Chebyshev Polynomials for approximation curve, however a new curve must be adjusted by algorithm 3 because the end points of curve are swing.