1) no fit polygon
临界多边形
1.
In this paper,the problem of calculating movement of piece is simplified to the problem of finding track line segments between vertices and edges,hence the time complexity is much reduced,and special cases such as inner cavity and inner NFP(no fit polygon) can also be tackled.
将多边形滑动碰撞问题转化为顶点和边之间的轨迹线提取问题,从而降低了时间复杂度,并可统一处理边界空腔和内部靠接临界多边形问题。
2) no-fit polygon
临界多边形
1.
An improved approach for no-fit polygon creation;
临界多边形生成算法的改进
2.
This paper presents a model based on discrete no-fit polygon for the two-dimensional irregular packing problem.
提出了一个用于求解二维不规则排样问题的离散临界多边形模型。
3) discrete no-fit polygon
离散临界多边形
1.
This paper presents a model based on discrete no-fit polygon for the two-dimensional irregular packing problem.
提出了一个用于求解二维不规则排样问题的离散临界多边形模型。
4) boundary polygon
边界多边形
6) boundary polygonization
边界多边形化
补充资料:凹多边形
Image:11534686683212413.jpg
把一个各边不自交的多边形任意一边向两方无限延长成为一直线,如果多边形的其他各边不在此直线的同旁,那么这个多边形就叫做凹多边形。
凹多边形的内角和的解,其实我们可以通过(n-2)·180来计算。实际上是把大于平角的角划分为两个角(如图)
说明:补充资料仅用于学习参考,请勿用于其它任何用途。