dc.contributor.author | Huang, Y. Q. | en_US |
dc.contributor.author | Liu, Y. K. | en_US |
dc.date.accessioned | 2015-02-16T07:26:44Z | |
dc.date.available | 2015-02-16T07:26:44Z | |
dc.date.issued | 2002 | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1111/1467-8659.00626 | en_US |
dc.description.abstract | Line clipping against a polygon is widely used in computer graphics such as the hidden line problem. A newline-clipping algorithm against a general polygon is presented in this paper. The basic idea of this algorithm is tochange the line to be clipped into a horizontal line by shearing transformation. Then each edge of the polygonalwindow is transformed by a shearing transformation with the same parameters as those used to the line. Eachedge of the polygon is processed against a horizontal line, which makes the clipping process simpler. The result inthis paper shows that less calculation is needed for the new algorithm with a higher speed compared to existingalgorithms. | en_US |
dc.publisher | Blackwell Publishers, Inc and the Eurographics Association | en_US |
dc.title | An algorithm for line clipping against a polygon based on shearing transformation | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 21 | en_US |
dc.description.number | 4 | en_US |
dc.identifier.doi | 10.1111/1467-8659.00626 | en_US |
dc.identifier.pages | 683-688 | en_US |