临界多边形是判别两个多边形相互关系的一个非常有效的方法。
No-Fit Polygon is an effective method to judge the relative position of two polygons.
提出了一个用于求解二维不规则排样问题的离散临界多边形模型。
This paper presents a model based on discrete no-fit polygon for the two-dimensional irregular packing problem.
当计算完临界多边形后，在临界多边形的多个顶点都可以排放零件。
After calculating no-fit polygon, a shape may be placed in many vertices of no-fit polygon.
求解轨迹线集合所形成的外包多边形和内部顺时针环，得到的多边形即为临界多边形。
Get the enclosing polygon and internal clockwise loops that was formed by the track line segments, finally the result polygons are the final NFPs.
为了减少多边形之间重叠性判断的计算量，在本文中采用了临界多边形算法，并对现有的临界多边形算法提出了改进。
To reduce calculation of overlapping judgement, algorithm of no-fit polygon is employed to guarantee that shapes are not overlapping in the paper, and existing algorithm of no-fit polygon is improved.
为了减少多边形之间重叠性判断的计算量，在本文中采用了临界多边形算法，并对现有的临界多边形算法提出了改进。
To reduce calculation of overlapping judgement, algorithm of no-fit polygon is employed to guarantee that shapes are not overlapping in the paper, and existing algorithm of no-fit polygon is improved.
应用推荐