关键词: 排样, 临界多边形, 改进算法

Abstract:

Nesting is the key problem to be solved in industrial areas.The optimal abutting position and overlapping heavy judgment of polygon are the most critical issues which need repeated calculation.The NFP's fast calculation has become a key nesting algorithm.After an introduction to the basic definition of NFP and mobile collision algorithm,we propose an improved algorithm for solving NFP based on sliding track.Then we describe the no-fit polygon's generation process and algorithm's implementation process.With the mobile collision algorithm as reference,we verify the improved algorithm's time complexity by experiments.Simulation results show that the improved algorithm can effectively reduce the time complexity of the algorithm and is therefore of value for solving the problem of nesting.

Key words: nesting;No Fit Polygon;improved algorithm