该文档为压缩文件,包含的文件列表如下:
内容介绍
原文档由会员 跟往事干杯 发布
最佳定位不规则形状的冲压模具带(英文翻译）
英文字符：32000
中文字数：10600
摘要：二维形状的嵌套是一个常见的问题，在原料方面必须经济切割。至于单通道单排带布局中，根据既定的方法，提出了几种算法。此外，应注意的是为了使解决方案适用于真实的工业环境优化布局还应考虑几个约束，像晶粒取向的后续成形、正确的宽度和卷金属的线宽。大部分程序直到现在表现在论文中仍然很复杂，往往忽略这些实际的约束。他们通常利用滑动技术，但并不能有效地处理较多串连的数字。特别是，大多数的不同于所推荐的程序是基于不适合多边形 （联络点) 计算的非凸多边形，这往往会造成空洞。这项工作是提出更多有效的方法，它能用于启发式程序。为了克服一些故障，大多数办法都在文学著作中，本文中提出新的几何实体，称为"不适合路径"(NFPh) 的非凸多边形上的应用。这使得研究人员能找到解决办法的嵌套问题，即有靠近的联络点由于对退化而断裂的解决方案。此外，不适合路径使研究人员能方便地读取、 修改或分享他们的成果，克服所有的这些问题所产生的大量的信息,通常从不同的来源和格式的所得数据。鉴于两个非凸多边形的算法是能够非常快速且无任何逼近多边形裁剪法计算他们的 NFPh。在这篇文章首先提出了一种完全自动化的程序。此过程首先获得"不适合路径"（NFPh）的最佳定位解 。该方法也让设计师制定一个允许设置金属成形的最佳定位，为了取得最佳的力学特性的裁片晶粒取向。
关键词:嵌套、单通道单排带布局、冲压模具带、临界多边形求解 Optimal positioning of irregular shapes in stamping die strip
Abstract: The nesting of two-dimensional shapes is a common problem, where raw material has to be economically cut. As for the single-pass single-row strip layout, several algorithms, base on established methods, have been proposed. Moreover, it should be noticed that the optimum layout should also consider a few constraints, like grain orientation for subsequent forming operation, correct bridge width, and the commercial roll of metal width in order to make solutions applicable in real industrial environments. Most of the procedures until now shown in literature are quite complex and often ignore these real constraints. They usually make use of sliding techniques and are not able to effectively work with relatively multiple-connected figures. In particular, most of the different proposed procedures are based on the No Fit Polygon (NFP) computation of non-convex polygons, which often generates holes. This work is a proposal for a more efficient method, which can be used in heuristic procedures. In order to overcome some faults of most of the former methods presented in literature, in this paper a new geometric entity called “No Fit Path” (NFPh) of no convex polygons is applied. It allows researchers to find solutions of nesting problems even when there are NFP faults due to degenerate solutions. Moreover, the No Fit Path allows researchers to easily read, modify, or share their results, overcoming all those problems arising from the usual large amount of information and from the different origins and formats of the obtained data. Given two no convex polygons, the algorithm is able to calculate their NFPh very quickly and without any approximation by a polygon clipping method. In this paper a totally automated procedure has been developed. This procedure firstly obtains the “No Fit Path” (NFPh); secondly, between all the existing positions on the NFPh, the algorithm searches the optimal one, minimizing the global waste. The proposed approach also allows designers to set an optimal orientation of the shapes on the roll of metal, taking account of the grain orientation in order to obtain the best mechanical characteristics for the cut pieces.
Keywords: Nesting .Single-pass single-row layout .Stamping die strip. Part layout.NFP
英文字符：32000
中文字数：10600
摘要：二维形状的嵌套是一个常见的问题，在原料方面必须经济切割。至于单通道单排带布局中，根据既定的方法，提出了几种算法。此外，应注意的是为了使解决方案适用于真实的工业环境优化布局还应考虑几个约束，像晶粒取向的后续成形、正确的宽度和卷金属的线宽。大部分程序直到现在表现在论文中仍然很复杂，往往忽略这些实际的约束。他们通常利用滑动技术，但并不能有效地处理较多串连的数字。特别是，大多数的不同于所推荐的程序是基于不适合多边形 （联络点) 计算的非凸多边形，这往往会造成空洞。这项工作是提出更多有效的方法，它能用于启发式程序。为了克服一些故障，大多数办法都在文学著作中，本文中提出新的几何实体，称为"不适合路径"(NFPh) 的非凸多边形上的应用。这使得研究人员能找到解决办法的嵌套问题，即有靠近的联络点由于对退化而断裂的解决方案。此外，不适合路径使研究人员能方便地读取、 修改或分享他们的成果，克服所有的这些问题所产生的大量的信息,通常从不同的来源和格式的所得数据。鉴于两个非凸多边形的算法是能够非常快速且无任何逼近多边形裁剪法计算他们的 NFPh。在这篇文章首先提出了一种完全自动化的程序。此过程首先获得"不适合路径"（NFPh）的最佳定位解 。该方法也让设计师制定一个允许设置金属成形的最佳定位，为了取得最佳的力学特性的裁片晶粒取向。
关键词:嵌套、单通道单排带布局、冲压模具带、临界多边形求解 Optimal positioning of irregular shapes in stamping die strip
Abstract: The nesting of two-dimensional shapes is a common problem, where raw material has to be economically cut. As for the single-pass single-row strip layout, several algorithms, base on established methods, have been proposed. Moreover, it should be noticed that the optimum layout should also consider a few constraints, like grain orientation for subsequent forming operation, correct bridge width, and the commercial roll of metal width in order to make solutions applicable in real industrial environments. Most of the procedures until now shown in literature are quite complex and often ignore these real constraints. They usually make use of sliding techniques and are not able to effectively work with relatively multiple-connected figures. In particular, most of the different proposed procedures are based on the No Fit Polygon (NFP) computation of non-convex polygons, which often generates holes. This work is a proposal for a more efficient method, which can be used in heuristic procedures. In order to overcome some faults of most of the former methods presented in literature, in this paper a new geometric entity called “No Fit Path” (NFPh) of no convex polygons is applied. It allows researchers to find solutions of nesting problems even when there are NFP faults due to degenerate solutions. Moreover, the No Fit Path allows researchers to easily read, modify, or share their results, overcoming all those problems arising from the usual large amount of information and from the different origins and formats of the obtained data. Given two no convex polygons, the algorithm is able to calculate their NFPh very quickly and without any approximation by a polygon clipping method. In this paper a totally automated procedure has been developed. This procedure firstly obtains the “No Fit Path” (NFPh); secondly, between all the existing positions on the NFPh, the algorithm searches the optimal one, minimizing the global waste. The proposed approach also allows designers to set an optimal orientation of the shapes on the roll of metal, taking account of the grain orientation in order to obtain the best mechanical characteristics for the cut pieces.
Keywords: Nesting .Single-pass single-row layout .Stamping die strip. Part layout.NFP
