一般多边形窗口的有效线裁剪算法.pdfVIP

39 　 1 　　　　　　　 Vol.39　No.1 2004 2 　　　　　　JO RNALOF SO THWEST JIAOTONG NIVERSITY　　　　　　 Feb.2004 　　:0258-2724(2004)01-0064-05 赵　平, 　冯　春, 　李柏林 (, 610031) 　:, . , , .、. :;;; :TP391　　:A Efficient Algorithm for Line Clipping against General Polygon ZHAO Ping, FENG Chun, LI Bo-lin (School of Mechanical Eng., Southwest Jiaotong niversity, Chengdu 610031, China) Abstract:Based on the analysis of advantages and disadvantages of the existing algorithms, a new algorithm for line clipping was proposed.This algorithm is composed of three steps:the intersection points of a line to be clipped and a general polygon are calculated, the line is cut into several sub-lines based on the intersection points, and whether these sub-line are cut or not is decided in light of their central points. The algorithm can deal with all kinds of situations easily and correctly. Key words:cutting method;polygon;computer graphics;line clipping 　　., , [1] ,Cohen-Sutherland ,Sproull Sutherland [2] [3] ,Barsky ., [4] CyrusBeck ., 、., , . [5] , ,, . [5,6] , ., .、, .[7], . , , : (1); (2); (3).,、. :2001-07-25 :863 (2002AA411210);(2200107); ([2001]498 ) :(1971-), , . 第1期 赵平等:一般多边形窗口的有效线裁剪算法 65 1 　 　　 Pi n , P =(P ,P ),P =P , L , i=0 i ix iy 0 n A B .A ,A ,B ,B A B x,y . x y x y [8] L , A B P ,P , …,P 0 1 n ,