基于轨迹线的临界多边形算法拓展  

Promotion of a No Fit Polygon Algorithm Based on Trajectory

作　　者：周鑫 赖晓阳[1] 孟祥群 王堃 唐厚君[1] ZHOU Xin;LAI Xiaoyang;MENG Xiangqun;WANG Kun;TANG Houjun(Department of Electrical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China;Shanghai Fangling Software Co.,Ltd.,Shanghai 200241,China)

机构地区：[1]上海交通大学电气工程系,上海200240 [2]上海方菱计算机软件有限公司,上海200241

出　　处：《上海交通大学学报》2021年第5期536-543,共8页Journal of Shanghai Jiaotong University

摘　　要：排料问题是指如何在有限的空间内装下最多指定形状物体的问题,在工业生产中有着重要的意义.其求解需要频繁对物体进行相交校验以判断排料位置是否合法.临界多边形算法可以用于加速相交校验过程,但算法本身不能计算曲线,限制了其应用.一种基于移动碰撞法的临界多边形算法可以将工件轮廓拓展至圆弧,但其计算速度较慢.针对该问题,在基于轨迹线的临界多边形算法的基础上,分析并改进了该算法的轨迹生成策略以及外包络轮廓算法.改进后的算法能够在较短的时间内计算出包含圆弧的临界多边形,同时解决了效率和精度问题.最后,在实际的冲床上进行了加工测试,测试结果验证了算法的正确性与效率.The nesting problem is how to nest objects of a specified shape in a two-dimensional space to obtain the maximum space utilization rate,which is of great significance in industrial production.The solution to the nesting problem requires frequent cross-checking of the objects to determine whether the nesting position is legal.The No Fit Polygon algorithm can be used to accelerate the procedure of cross-checking,but the algorithm cannot be used to calculate shapes containing curves,which limits its application.An algorithm based on orbit sliding can calculate No Fit Polygon between shapes which includes arc,but its effectiveness is not satisfactory.Aimed at this problem,and based on trajectory algorithm,the trajectory generation strategy and the profile algorithm are analyzed and improved.The improved algorithm can calculate the No Fit Polygon between shapes containing arc in a shorter time,solving both accuracy and effectiveness problems.Finally,the algorithm is tested in the real punch production process and the results of the test confirms the correctness and effectiveness of the algorithm.

关 键 词：临界多边形 轨迹线算法 排料问题 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]