计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (1): 198-198.

• 工程与应用 • 上一篇    下一篇

基于包容矩形的优化排样算法及实现

李爱平,张丰,刘雪梅   

  1. 同济大学机械学院现代制造所
  • 收稿日期:2006-06-27 修回日期:1900-01-01 出版日期:2007-01-01 发布日期:2007-01-01
  • 通讯作者: 张丰 sandyzf

Range Box-based Algorithm for Optimal Blank Layout

,,   

  1. 同济大学机械学院现代制造所
  • Received:2006-06-27 Revised:1900-01-01 Online:2007-01-01 Published:2007-01-01

摘要: 毛坯优化排样问题是CAD技术结合冲模设计领域的一大课题。本文在多边形顶点算法的基础上,提出了基于包容矩形的优化排样算法。该算法只需在初始毛坯图的包容矩形内进行计算,即可得到排样的步距、料宽等关键参数;在预排样时不用进行传统排样算法所作的等距放大处理,避免了由此引起的图形自交干涉和排样误差增大的问题。并且在Inventor 9平台上运用Visual C++对该算法予以实现,开发出效率高、实用性强、运行可靠的冲裁模智能排样系统。

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++.