自由曲线集极大区域自动识别算法  

AN AUTOMATIC PICKING UP ALGORITHM FOR MAXIMUM REGIONS FROM FREE CURVE SET

作　　者：曾小英[1] 谭正华[1] 

机构地区：[1]湘潭大学信息工程学院,湖南湘潭411105

出　　处：《计算机应用与软件》2012年第6期148-150,195,共4页Computer Applications and Software

基　　金：湖南省教育厅一般项目(10C1261);湘潭大学博士基金项目(11QDZ11)

摘　　要：为了提取平面自由曲线集相交、自相交形成的多个极大区域,提出一种有效的区域自动识别算法:对相交、自相交的自由曲线进行打断操作,生成结点-边链表,根据"外层路径优先"搜索算法,提取各极大区域的边界。该算法已成功地应用于服装CAD中的衣片提取,实验结果表明该算法准确、速度快,能够实现任意复杂自由曲线形成的封闭区域的识别和提取。Free curves cut across each other and themselves to form one or more maximum regions on a plain.In order to extract the maximum regions,an effective maximum regions auto recognizing algorithm is proposed.This algorithm can extract the maximum regions through interrupting the free curves to generate a node-edge list with ＂the outermost layer path first＂ rule.The algorithm has been applied to a CAD software to extract garment pieces fast and accurately.It can extract any enclosed area formed by free curve set.

关 键 词：极大区域 提取算法 外层路径优先 曲线集 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]