【摘要】 在以往的计算机求解冲裁件优化排样方案中，用于求解冲裁步距的时间过长（如移步法［１－２］，大大影响了排样速度．本文在分析两图形相交条件的基础上，应用分断和离散函数求距法，提出了快速精确计算步距的新算法，大幅度减少了排样时间，有实用价值．更多还原

【Abstract】 A number of blanking layout solutions have been developed but most of the methods require rather lengthy time to compute steps (e.g. the moving step method),which greatly. Based on analyzing intersect conditions of two graph. A new algorithm of computing accurate layout element step is presental in this paper by using discrete functions to calculate step The optimization time is greatly cut down by taking this algorithm thus it is of much value for layout of blank.更多还原