Unifying Vector and Polygon Algorithms for Scan Conversion and Clipping
dc.contributor.author | Kilgour, AIistair | en_US |
dc.date.accessioned | 2015-10-05T07:55:25Z | |
dc.date.available | 2015-10-05T07:55:25Z | |
dc.date.issued | 1987 | en_US |
dc.identifier.issn | 1017-4656 | en_US |
dc.identifier.uri | http://dx.doi.org/10.2312/egtp.19871028 | en_US |
dc.description.abstract | In both scan conversion and clipping, algorithm for dealing with polygons are generally presented independently of those for vectors, although many of the operations performed are similar. This paper shows how polygon algorithms for both problems can be developed from the corresponding vector algorithm. As well as yielding a unification at the conceptual level, this approach can lead to reduced code size in graphics system implementation, and produces polygon algorithms which are comparable in both robustness and efficiency with those previously presented. | en_US |
dc.publisher | Eurographics Association | en_US |
dc.title | Unifying Vector and Polygon Algorithms for Scan Conversion and Clipping | en_US |
dc.description.seriesinformation | EG 1987-Technical Papers | en_US |
dc.identifier.doi | 10.2312/egtp.19871028 | en_US |
Files in this item
This item appears in the following Collection(s)
-
EG1987 Proceedings (Technical Papers)
EG Conference Proceedings -
EG1987 Proceedings (Technical Papers)