摘要
为了提高服装CAD排料的利用率,对移动多边形与排料区中的轮廓多边形间的嵌套操作提出了一种新算法。该算法结合多边形顶点算法速度快以及等距平行线组分割算法耦合度高的优点,解决了两多边形间的嵌套问题,弥补了多边形顶点算法与等距平行线组分割算法各自的缺陷。
In packing system, a new algorithm of nesting operation between the moving polygon and the outline polygon is provided in this paper in order to improve the garment CAD packing efficiency. This algorithm resolves it by combining the polygon vertex method and the equidistance parallel partition method in order to improve the speed and the coupling, making up the demerit of the polygon vertex method and the equidistance parallel partition method.
出处
《浙江理工大学学报（自然科学版）》
2008年第2期151-154,共4页
Journal of Zhejiang Sci-Tech University(Natural Sciences)
关键词
服装排料
嵌套
多边形
garment layout
nesting
polygon
