基于遗传算法的封闭轮廓最小面积凸包围盒生成算法  

Research for Generating Min-Area Convex Encasing Box for Arbitrary Closed Contour Based on Genetic Algorithm

作　　者：刘云[1] 戴光明[2] 王茂才[2] 

机构地区：[1]沙洋师范高等专科学校数理系,湖北荆门448200 [2]中国地质大学计算机学院,湖北武汉430074

出　　处：《孝感学院学报》2007年第3期63-66,共4页JOURNAL OF XIAOGAN UNIVERSITY

基　　金：湖北省自然科学基金项目(2003ABA045)

摘　　要：许多工程应用中需要计算区域最小面积的包围盒。当前工程实践中通常采用的是面积最小的矩形包围盒,而最小面积矩形包围盒在许多工程实践中由于存在较大误差因此并不能满足应用需求。本文基于遗传算法的思想,研究并提出了任意封闭区域(轮廓)最小面积的凸包围盒生成算法。该算法简单,速度快,效果显著。实际应用表明了该算法的有效性与实用性。In many engineering applications, it is necessary to calculate the min - area encasing box of a circumscription. In the current engineering practices, the encasing box applied widest is the smallest rectangular encasing boxes. However, the smallest rectangular encasing boxes cant meet the application requirement because of errors. In this paper, an algorithm for generating the rain - area convex quadrangle encasing box, based on genetic algorithm, is investigated and hence put forward. Practical application suggests its usefulness and efficiency.

关 键 词：遗传算法 凸多边形 最小包围盒 

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