Gourret, J.P.Paille, J.2014-10-212014-10-2119871467-8659https://doi.org/10.1111/j.1467-8659.1987.tb00560.xA 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.10.1111/j.1467-8659.1987.tb00560.x317-325