一种基于迭代提取关键点的曲线拟合新算法  

A New Algorithm to Fit Curves Based on Keypoints Which were Extract Iteratively

作　　者：荆晶[1] 刘玉兰[1] 葛庆平[1] 

机构地区：[1]首都师范大学信息工程学院,北京100037

出　　处：《首都师范大学学报（自然科学版）》2004年第S1期22-25,共4页Journal of Capital Normal University：Natural Science Edition

基　　金：国家 8 63高技术研究发展计划项目 (2 0 0 1AA115 190 -0 8);北京市教委项目 (KM2 0 0 3 10 0 2 810 9)资助课题

摘　　要：在计算机辅助设计及相关领域中 ,需要对曲线进行精确的拟合 ,针对这一需求 ,提出了一种基于迭代提取关键点的曲线拟合新算法 .在该算法中 ,对两个端点之间的一段曲线迭代寻找关键点 ,当相邻两曲线段上加上关键点时则删除他们之间的一个原有关键点 ,以减少关键点数量 .算法用阈值T作为结束条件来控制精度 .由于T值可变 ,设计者可根据不同需求自行设置T值直到满足某一特定的要求为止 .文中给出了算法的原理、实现过程以及试验结果 .结果表明 ,该算法计算简单 ,以少而精确的关键点使曲线进行拟合达到较好的效果 .In computer aided design and some correlative fields,it is needed to fit curves accurately.For this reason,a new algorithm to fit curves based on key points which were extract iteratively is presented in this paper.It searchs the key points between tow end points using iterative moethod.It tow new sequent key points are added,the former key point between them will be deleted to reduce the number of the key points.This approach could control the precision by some threshold.Because the threshold is alterable,designers could set it according to their need until a certain precisionis gotten.The principle of this algorithm,along with its realizing process and the results is introduced in this paper.According to the experiments,this algorithm is easy to compute and it can make a nice fitting using least but precise keypoints

关 键 词：关键点 曲率 迭代 距离 曲线拟合 

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