Title of article
An algorithm for line clipping against a polygon based on shearing transformation
Author/Authors
Y. Q.Huang ، نويسنده , , Y. K.Liu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
6
From page
683
To page
688
Abstract
Line clipping against a polygon is widely used in computer graphics such as the hidden line problem. A new
line-clipping algorithm against a general polygon is presented in this paper. The basic idea of this algorithm is to
change the line to be clipped into a horizontal line by shearing transformation. Then each edge of the polygonal
window is transformed by a shearing transformation with the same parameters as those used to the line. Each
edge of the polygon is processed against a horizontal line, which makes the clipping process simpler. The result in
this paper shows that less calculation is needed for the new algorithm with a higher speed compared to existing
algorithms.
Keywords
concave window , Computer graphics , line clipping , shearing transformation , intersection calculation
Journal title
Computer Graphics Forum
Serial Year
2002
Journal title
Computer Graphics Forum
Record number
404482
Link To Document