Approximation of digitized curves with cubic Bézier splines

In this paper we examine a problem of digitized curves approximation for raster graphics vectorization and develop an efficient implementation of a near-optimal Dynamic Programming algorithm for digitized curves approximation with cubic Bézier splines for a given distortion bound. For better fitting performance, we introduce the inflection points with relaxed constraint of tangent continuity. The proposed algorithm demonstrates superiority over the iterative breakpoint-insertion method in terms of segments number for a given distortion bound.