Premium
Irregular Polygon Fill Using Contour Encoding
Author(s) -
Gourret J.P.,
Paille J.
Publication year - 1987
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.1987.tb00560.x
Subject(s) - polygon (computer graphics) , raster graphics , encoding (memory) , computer science , computer graphics (images) , regular polygon , computer graphics , point in polygon , computer vision , graphics , polygon covering , artificial intelligence , algorithm , mathematics , polygon mesh , geometry , telecommunications , frame (networking)
A 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.