首页 | 本学科首页   官方微博 | 高级检索  
     检索      

各种排样方式下顶点算法的研究
引用本文:刘岩,蔡玉俊,闫振华,叶正华.各种排样方式下顶点算法的研究[J].太原科技大学学报,1997(3).
作者姓名:刘岩  蔡玉俊  闫振华  叶正华
作者单位:太原重型机械学院,桂林电器科学研究所模具分所
摘    要:多边形顶点算法是冲裁排样优化问题的一种新算法。本文在单排顶点算法的基础上,对其它常用排样方式进行了研究,通过对原图形数组的适当拆分和重组构成新的多边形,即可采用在图形内求多边形顶点处宽度的算法。该算法不仅简化了计算,提高了运算速度,而且保证了最优解。

关 键 词:冲裁排样  优化算法

Polygon Vertex Algorithm in Different Blanking Layouts
Liu Yan,Cai Yujun,Yan Zhenhua.Polygon Vertex Algorithm in Different Blanking Layouts[J].Journal of Taiyuan University of Science and Technology,1997(3).
Authors:Liu Yan  Cai Yujun  Yan Zhenhua
Abstract:A polygon vertex algorithm is a new optimizing method of blanking layout. In this paper, other conventional layouts are also studied based on the single line layout method.It is available to calculate the width of the vertexes within new polygons,when those are formed through proper separating and rebuilding the array of the original polygons. This method not only simplifies the calculation and raises the speed of operation, but also guarantee the optimization result.
Keywords:blanking layout  optimization method
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号