Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《CHINESE JOURNAL OF COMPUTERS》 1999-11
Add to Favorite Get Latest Update

AN EFFICIENT ALGORITHM FOR THE LINE CLIPPING AGAINST A POLYGON

LIU Yong Kui 1) YAN Ye 1) SHI Jiao Ying 2) 1) (Information Science and Engineering College, Shenyang Polytechnic University, Shenyang 110023) 2) (State Key Laboratory of CAD & CG, Zhejiang University, Hangzhou 310027  
Existing line clipping algorithms are all offered based on a rectangular window or a convex polygonal window. No algorithm for line clipping against a generalized polygon (or concave polygon) is available in the literatures. It is quite valuable to develop such algorithms, because they are of practical use just like the hidden line problem. In this paper, a line clipping algorithm against a generalized polygon is presented. First a reference point is chosen on the line. Then the slope from each vertex of the polygon to the reference point is calculated. Now if the slope of the line is between the slopes from two adjacent vertexes of the polygon to the reference point, the line intersects the edge between the two vertexes. So for each edge, only one division and one subtraction as well as four comparisons are needed.
【Fund】: 国家自然科学基金
【CateGory Index】: TP391.41
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved