摘要
在已有的一般多边形窗口的线裁剪算法的基础上提出了一个新算法,该算法通过内包围盒的方法,排除大量不与裁剪线段相交的多边形的边,从而降低了求交中复杂度极高的乘除法运算量,保证了算法的快速、高效.
This article proposes a new algorithm based on algorithms the line clipping against apolygon, which surrounds the box through in the method, removes massively the polygon side which does not cut out the line segment intersection, thus reduces complex extremely high while the division operand, and guarantees the algorithm fast, and highly effective.
出处
《甘肃联合大学学报（自然科学版）》
2007年第4期92-94,共3页
Journal of Gansu Lianhe University :Natural Sciences
基金
辽宁省教育厅青年基金项目(20040022)
