| 用遗传算法求平面点列的最小包容圆 |
| |
| 引用本文： | 王洪发,刘捷. 用遗传算法求平面点列的最小包容圆[J]. 南昌大学学报(工科版), 2007, 29(4): 384-386 |
| |
| 作者姓名： | 王洪发 刘捷 |
| |
| 作者单位： | 浙江水利水电专科学校,浙江,杭州,310018;南昌大学,计算中心,江西,南昌,330031 |
| |
| 基金项目： | 江西省科技攻关资助项目(20061B0103500) |
| |
| 摘 要： | 在机械制造和模具加工中,经常要评价圆面的造形误差,通常引入平面点列包容圆的几何概念,显然一个平面点列有无数个包容圆。为求得最小的包容圆,建立了求平面点列包容圆的数学模型,将求最小包容圆问题转化为函数优化问题,并用遗传算法解决了这个函数最优解的求解问题。实测结果表明,文中求平面点列最小包容圆的算法收敛速度快,精度高。
|
| 关 键 词： | 平面点列 最小包容圆 遗传算法 |
| 文章编号： | 1006-0456（2007）04-0384-03 |
| 收稿时间： | 2007-03-19 |
| 修稿时间： | 2007-03-19 |
Finding Minimum Contain Circle of Plane Finite Points with Genetic Algorithm |
| |
| WANG Hong-fa,LIU Jie. Finding Minimum Contain Circle of Plane Finite Points with Genetic Algorithm[J]. Journal of Nanchang University(Engineering & Technology Edition), 2007, 29(4): 384-386 |
| |
| Authors: | WANG Hong-fa LIU Jie |
| |
| Affiliation: | 1.Zhejiang Water Conservancy and Hydropower College, Hangzhou 310018, China;2.Computing Center, Nanchang University, Nanchang 330031, China |
| |
| Abstract: | In machine manufacturing and mode processing,it is always required to access the shaping difference of a circle plane.The usual solution is with the geometry concept that point array of a plane wraps the cirle.It is obviously that a planar point set has innumerable circumscribled circles.To get a minimum circumscribled circle,a mathematical model is built to transform the problem of getting a minimum circumscribled circle to the problem of optimizing function and to solve the function optimization with genetic algorithm.Test results show that,the algorithm in this paper is fast in speed and high in accuracy. |
| |
| Keywords: | plane finite points minimum contain circle genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
