改进Rosenbrock算法求包含平面多边形的最小圆  

IMPROVING ROSENBROCK ALGORITHM TO FIND THE SMALLEST CIRCLE CONTAINING A POLYGON

作　　者：朱平[1] 欧阳春娟[1,2] 冷明[1] 

机构地区：[1]井冈山大学电子与信息工程学院,江西吉安343009 [2]深圳大学信息工程学院,广东深圳518060

出　　处：《井冈山大学学报（自然科学版）》2012年第1期53-56,共4页Journal of Jinggangshan University (Natural Science)

基　　金：国家自然科学基金项目(61063007;61163062);江西省教育厅科学技术研究项目(赣教技字[2007]320号);江西省教育厅科学技术研究项目(GJJ11538)

摘　　要：针对求包含平面多边形的最小圆问题,提出应用Rosenbrock算法求包含平面多边形的最小圆。指出对于上述求最小圆问题,Rosenbrock算法搜索极值点的成败与算法初始点的选择有关。分析了当Rosenbrock算法搜索失败时,目标函数在初始点附近取值情况;对Rosenbrock算法进行了改进:若算法在初始点X0沿初始标准正交向量组的搜索没有取得进展,将初始标准正交向量组作一旋转,得到新的标准正交向量组,算法在初始点X0沿新的标准正交向量组继续搜索。仿真实验表明,改进Rosenbrock算法有更好的搜索效果。The problem of finding the smallest circle that contains a given plane polygon comes from the research fields of machine hardware machining and computer graphics. A method applying Rosenbrock algorithm to find the smallest circle that contains a given plane polygon is put forward in this paper. For the smallest circle problem, the success or failure of searching extreme point by Rosenbrock algorithm depends on the choice of the initial point. This paper analyses the goal function condition near the initial point at which Rosenbroek algorithm failed to search the extreme point, and puts forward an improvement to Rosenbrock algorithm. That is to say, if searches by Rosenbrock algorithm along the directions of the initial standard orthogonal vectors at the initial point X0 have no progress, let＇s rotate the initial standard orthogonal vectors to get new standard orthogonal vectors, and continue searching along the new standard orthogonal vectors at the initial point. Simulation experimental results verify that the improved Rosenbrock algorithm has better search effects.

关 键 词：Rosenbrock算法 最小圆 极值 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]