检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵德胜[1] 张雪[1] 李丽萍[1] 郑鹏[1] 卜康
出 处:《西安邮电大学学报》2014年第2期82-84,107,共4页Journal of Xi’an University of Posts and Telecommunications
基 金:陕西省教育厅科学研究计划基金资助项目(12JK0750)
摘 要:为了把工程图划分成不同的视图区,针对已有视图识别算法的局限性,利用黄金分割优化算法对CAD图形进行视图识别。进行数学建模,把整个图形区分别按照纵横两个方向进行识别。以图形各图元交点纵(横)坐标最大值和最小值作为初始优化搜索区间,判断视图分割线与图元交点横(纵)坐标值大小,确定新搜索区间。再把视图分割线与图元交点数量作为目标函数,交点数量为零的分割线作为视图分界线,从而把工程图划分成不同的视图区。仿真算例表明,黄金分割优化算法可实现标准工程三视图基本视图区域的分割,且适用于含有多视图的非标准工程图。Due to defects of the existing algorithm,the golden section optimization algorithm is used to partition regions of orthographic views in order to divide the engineer drawing into several views.The whole region is divided on the X axle and the Y axle while a mathematical modeling is built.The max and the min coordinate values of the graphic elements' intersection points by the Y(X)axle are regarded as the initial interval of search.The new interval of search is achieved after the coordinate values of the intersection points of the graphic elements by the X(Y)axle and the lines which are used to split the views are compared.The number of the points is regarded as the objective function and the splitter with no intersection points as the views' line of demarcation.Simulation experiments show that the engineering drawing can be partitioned fast by the golden section algorithm.The algorithm is fit for not only the standard three orthographic views but also nonstandard orthographic with views more than three.The efficiency and practicality of the algorithm are authenticated by examples.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.82