Irregular Polygon Fill Using Contour Encoding

Simple item page
dc.contributor.authorGourret, J.P.en_US
dc.contributor.authorPaille, J.en_US
dc.date.accessioned2014-10-21T05:39:27Z
dc.date.available2014-10-21T05:39:27Z
dc.date.issued1987en_US
dc.description.abstractA filling algorithm for irregular polygons is described. This algorithm is oriented towards raster graphics and uses image memories as job areas. The algorithm is based on the encoding of polygon boundaries by contour following so that all topologies are successfully processed. Thus, concave or convex polygons, holed or not, including possibly duplicate points can be filled. It is quite robust and easy to implement. It uses systematic encoding without special cases. Only two bits for encoding are needed and, thereby, it is suitable for hardware implementation.This algorithm can be used in many fields such as image synthesis, 3D objects or mathematical surface displays with hidden parts.en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume6en_US
dc.identifier.doi10.1111/j.1467-8659.1987.tb00560.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages317-325en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1987.tb00560.xen_US
dc.publisherBlackwell Publishing Ltd and the Eurographics Associationen_US
dc.titleIrregular Polygon Fill Using Contour Encodingen_US
Files
Collections
Issue 4