期刊文献+

基于“由粗到细”思想的钣金废料嵌套问题快速求解算法

Fast Algorithm for Solving Sheet Metal Scrap Nesting Problem Based on“Coarse-to-Fine”Strategy
在线阅读 下载PDF
导出
摘要 钣金切割中的废料再利用问题,可视为允许单个多边形平移旋转的2个简单多边形嵌套关系的判断问题.采用“由粗到细”的思想,整合多种方法的优势,提出一种快速求解此类问题的算法.首先使用一些规则对多边形的旋转角度进行离散并排序;然后利用包围盒、栅格化等方法,粗略判断多边形在平移下是否嵌套;最后利用临界多边形算法,精确判断2个多边形的嵌套关系.在332个实际激光切割工业样例上的实验结果表明,在保证正确率为98.5%的情况下,所提算法的平均耗时降低到单一的临界多边形算法的23.8%. The problem of recycling waste in sheet metal cutting can be considered as a problem of determining the nesting relationship between two simple polygons under the translation and rotation of a single polygon.By adopting the“coarse-to-fine”strategy and integrating the advantages of multiple methods,an algorithm for quickly solving this problem is proposed.Firstly,some rules are used to discretize and sort the rotation angles of polygons.Then,methods such as bounding box and rasterization are utilized to roughly determine whether polygons are nested under translation.Finally,the no-fit polygon algorithm is employed to accurately determine the nesting relationship between two polygons.Experimental results on 332 actual industrial laser cutting samples demonstrate that,while maintaining an accuracy of 98.5%,the proposed algorithm reduces the average time consumption to 23.8%of that of the single no-fit polygon algorithm.
作者 陈播 胡银雷 陈发来 Chen Bo;Hu Yinlei;Chen Falai(School of Mathematical Sciences,University of Science and Technology of China,Hefei 230026)
出处 《计算机辅助设计与图形学学报》 北大核心 2025年第1期28-39,共12页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金(61972368,12371383) 安徽省自然科学基金(2308085QA07) 中国博士后科学基金(2023M733383) 中央高校基本科研业务费专项资金(WK0010000085).
关键词 废料再利用 钣金切割 简单多边形嵌套 二维排样 二维下料 scrap recycling sheet metal cutting simple polygon nesting 2D layout 2D cutting
作者简介 陈播(1999-),男,硕士研究生,主要研究方向为计算机辅助几何设计;通信作者:胡银雷(1993-),男,博士,CCF会员,主要研究方向为计算机辅助几何设计、生物信息学,hyl2016@ustc.edu.cn;陈发来(1966-),男,博士,教授,博士生导师,CCF高级会员,主要研究方向为计算机辅助几何设计、计算机图形学.
  • 相关文献

参考文献7

二级参考文献45

  • 1朱延娟,周来水,张丽艳,刘爽.基于Hausdorff距离的多尺度轮廓匹配算法[J].中国机械工程,2004,15(17):1553-1556. 被引量:26
  • 2胡华,蔡昕,姚骏.任意连通多边形的靠接算法[J].计算机学报,1995,18(11):867-874. 被引量:10
  • 3黄有群,刘嘉敏,朴致淳.剪床排料的计算机辅助设计[J].小型微型计算机系统,1995,16(7):43-47. 被引量:6
  • 4王文成,李晓伟,智佳,赵彦发.基于Hausdorff距离的轮廓线匹配[J].西安邮电学院学报,2007,12(3):91-94. 被引量:13
  • 5崔屹.图像处理与分析[M].科学出版社,2000.43-55.
  • 6P C Gilmore, R E Gomory. A linear programming approach to the cutting stock problem-Part 1 [J ] . Operations Research,1961, 9(6): 848-859.
  • 7J E Beasley. Algorithms for unconstrained two-dimensional guillotine cutting [ J ] . Journal of the Operational Research Society, 1985, 36(4) : 297-306.
  • 8A A Farley. Mathematical programming models for cutting-stock problems in the clothing industry [ J ] . Journal of the Operational Research Society, 1988, 39( 1): 41-53.
  • 9M S Reda, E A Abd. An interactive technique for the cutting stock problem with multiple objects[J ] . European Journal of Operational Research, 1994, 78(3) : 304-317.
  • 10M Shpitalni, V Menevich. Optimal orthogonal subdivision of rectangular sheets [ J ] . Transactions of ASME Journal of Manufacturing Science end Engineering, 1996, 118(3) : 281-288.

共引文献226

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部