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

基于包容矩形的优化排样算法及实现
引用本文:李爱平,张丰,刘雪梅.基于包容矩形的优化排样算法及实现[J].计算机工程与应用,2007,43(1):198-200,220.
作者姓名:李爱平  张丰  刘雪梅
作者单位:同济大学,现代制造技术研究所,上海,200092
摘    要:毛坯优化排样问题是CAD技术结合冲模设计领域的一大课题。论文在多边形顶点算法的基础上,提出了基于包容矩形的优化排样算法。该算法只需在初始毛坯图的包容矩形内进行计算,即可得到排样的步距、料宽等关键参数;在预排样时不用进行传统排样算法所作的等距放大处理,避免了由此引起的图形自交干涉和排样误差增大的问题。并且在Inventor9平台上运用VisualC++对该算法予以实现,开发出效率高、实用性强、运行可靠的冲裁模智能排样系统。

关 键 词:冲裁件  优化排样  算法  Inventor
文章编号:1002-8331(2007)01-0198-03
修稿时间:2006-10

Range box-based algorithm for optimal blank layout
LI Ai-ping,ZHANG Feng,LIU Xue-mei.Range box-based algorithm for optimal blank layout[J].Computer Engineering and Applications,2007,43(1):198-200,220.
Authors:LI Ai-ping  ZHANG Feng  LIU Xue-mei
Affiliation:Institute of Advanced Manufacturing Technology,Tongji University,Shanghai 200092, China
Abstract:The optimization of blank layout is an important part of computer aided die designing.Based on the polygonal vertices algorithm,a new method based on range box is introduced for optimal layout in the blanking process.The key parameters such as feed pitch and strip width can be calculated only in the range box of the original polygon.The offsetting of the polygon is avoided in this method which is frequently used in other traditional algorithms that may cause interference and error in the pretreatment.Moreover,a practical and efficient optimization system for blank layout is developed on Inventor 9 with Visual C++.
Keywords:blanking  optimal layout  algorithm  Inventor
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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