A Scan Strip Based Algorithm for Line Clipping against Arbitrary Polygons
In this paper, a scan strip based algorithm for line clipping is presented. The clipping windows can be combined with arbitrary polygons that are separated from each other. One polygon can be a hole of the others. Vertices of all polygons are first located against the line to be clipped. Then, scan lines through vertices are created and correlative strip data are momentarily changed. The number of polygon edges on the left side of the clipped line in the same strip is increased. Finally, the visibility of clipped line is determined by the parity of the number of edges to the left of clipped line. Both theoretic analysis and experimental results compared with the classical Cyrus-Beck algorithm is presented to demonstrate that the scan strip algorithm uses less multiplication-division time (MDT) and has higher executing speed.
computer graphics Line clipping Scan line Scan strip
YU Xiaohong XU Jinhua
College of Computer Science & Information Enginerring Zhejiang Gongshuang University No.18,Xuezheng Modern educational technology Center Zhejiang Gongshuang University No.18,Xuezheng Str.,Xiasha Unive
国际会议
武汉
英文
370-374
2007-07-25（万方平台首次上网日期，不代表论文的发表时间）