平面数字曲线的二次Bézier曲线逼近  

Optimum Approximation of Digital Planar Curves Using Quadric Bézier Curves

作　　者：周天祥[1] 

机构地区：[1]绍兴文理学院计算机系,浙江绍兴312000

出　　处：《绍兴文理学院学报》2007年第7期46-54,共9页Journal of Shaoxing University

摘　　要：介绍了一种动态规划算法,通过使用二次Bézier曲线段拟合平面曲线,提取出曲线中的特征点,从而达到曲线分段的目的.在一般的分段曲线的逼近应用中,人们往往是采用高次的Bézier或B-spline曲线,不过其目的是在于逼近的精确度,而不是特征点的选取.在平面曲线的特征点检测中,通过使用高次曲线来逼近曲线是可以得到更精确的结果,但是其计算量却是不堪忍受的.本文提出的算法利用了二次Bézier曲线的特性,通过在进行动态规划的误差矩阵计算时,使用增量误差计算的方法,从而减少了计算的复杂度.A dynamic programming algorithm was employed to detect dominant points within a planar digital curve by approximating the given curve with quadric Bézier curves. Normally, cubic or higher curves are used to piecewise approximate a given curve, and the main job is to achieve an accurate approximation instead of dominant point detection. Bézier. In the computation of approximation error army, increasing error measure is achieved. Compared with the circular arcs and lines approach to the approximation of the given curve, our method produced better results without increasing the computational complexity.

关 键 词：曲线分段 动态规划 BÉZIER曲线 增量误差计算 曲线的多边形表示 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]