基于退火遗传算法的NURBS曲线逼近  

NURBS curve approximation based on the annealing genetic algorithm

作　　者：刘彬[1] 张仁津[1] 

机构地区：[1]贵州师范大学数学与计算机科学学院,贵州贵阳550001

出　　处：《山东大学学报（工学版）》2010年第5期96-100,共5页Journal of Shandong University（Engineering Science）

基　　金：贵州省科学技术基金资助项目(黔科合J字LKS[2009]14号);贵州省优秀科技教育人才省长专项资金资助项目(黔省专合字[2009]115号)

摘　　要：利用退火遗传算法实现任意阶、任意节点数的非均匀有理B样条(non uniform rational bspline,NURBS)曲线逼近型值点序列。首先将NURBS曲线的控制顶点、权、节点序列和逼近型值点的t参数序列用浮点数编码为基因个体,然后通过循环执行交叉算子、变异算子和退火选择算子求解寻找最优解或者次优解。最后用四种不同控制顶点数和次数的NURBS曲线逼近同一个型值点序列,给出了4种不同条件下的数值结果和图形。实验结果表明通过退火遗传算法能够稳定地用不同次数和控制顶点个数的NURBS曲线逼近型值点序列。The annealing genetic algorithm was presented to approximate a sequence of characteristic points by NURBS curve with any order and any number of knots.First,the control vertices,weights of NURBS curves,knots sequence and t parameters approximating characteristic points were encoded as genes.Then the cross operator,mutation operator and annealing selection operator were executed cyclically to search the global optimum or the sub-optimal.Finally,four NURBS curves with different number of control vertices and degrees were used to approximate the same sequence of characteristic points.Four groups of numerical values and four graphics in different condition were presented.An example proves that the annealing genetic algorithm can stably approximate the NURBS curves with different degrees and number of control vertices.

关 键 词：退火遗传算法 NURBS曲线 逼近 

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