Particle swarm optimization algorithm for B-spline curve approximation with normal constraint

被引：0

作者：

Hu, Liangchen ^{[1
]}

Shou, Huahao ^{[1
]}

机构：

[1] College of Science, Zhejiang University of Technology, Hangzhou,310023, China

来源：

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics | 2016年 / 28卷 / 09期

关键词：

B-spline approximation - Constrained optimi-zation problems - Discrete data - Knot Vectors - Non-linear optimization problems - Normal constraints - Particle swarm optimization algorithm - Unconstrained optimization problems;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

If the knot vector and control points of a B-spline curve are variable, the B-spline curve approximation with normal constraint problem becomes a multidimensional, multivariate and highly nonlinear optimization problem with normal constraints, the conventional method of inverse equation system is difficult to obtain the optimal solution. Aiming at this kind of problem, a particle swarm optimization (PSO) method is introduced to solve the curve approximation problem with normal constraints. Firstly, the penalty function method is used to transform the constrained optimization problem into an unconstrained optimization problem. Secondly, a suitable fitness function which is closely related to both data points and normal constraints is constructed. Finally, PSO is applied to adjust the knot vector, and at the same time, the least square method is used to solve the optimal control points, do loop iteration until the best B-spline curve approximation is produced. By a comparison with existing methods, the superiority of the proposed method is highlighted. Test results show that this method is practical in solving the curve approximation problem with normal constraints. © 2016, Beijing China Science Journal Publishing Co. Ltd. All right reserved.

引用

页码：1443 / 1450