Abstract:

The annealing genetic algorithm is 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. In the end, four NURBS curves with different number of control vertices and degree were used to approximate the same sequence of characteristic points. Four groups of numerical values and four graphics in different condition were presented. The example proves that the annealing genetic algorithm can stably approximate the NURBS curves with different degree and number of control vertices.

Key words: annealing genetic algorithm, non uniform rational b-spline curve, approximation