Unifying Vector and Polygon Algorithms for Scan Conversion and Clipping

Simple item page
dc.contributor.authorKilgour, AIistairen_US
dc.date.accessioned2015-10-05T07:55:25Z
dc.date.available2015-10-05T07:55:25Z
dc.date.issued1987en_US
dc.description.abstractIn 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.description.seriesinformationEG 1987-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19871028en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19871028en_US
dc.publisherEurographics Associationen_US
dc.titleUnifying Vector and Polygon Algorithms for Scan Conversion and Clippingen_US
Files
Collections
EG1987 Proceedings (Technical Papers)
EG1987 Proceedings (Technical Papers)