Show simple item record

dc.contributor.authorHuang, Y. Q.en_US
dc.contributor.authorLiu, Y. K.en_US
dc.date.accessioned2015-02-16T07:26:44Z
dc.date.available2015-02-16T07:26:44Z
dc.date.issued2002en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/1467-8659.00626en_US
dc.description.abstractLine 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.publisherBlackwell Publishers, Inc and the Eurographics Associationen_US
dc.titleAn algorithm for line clipping against a polygon based on shearing transformationen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume21en_US
dc.description.number4en_US
dc.identifier.doi10.1111/1467-8659.00626en_US
dc.identifier.pages683-688en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record