Description: The planar area filling algorithm is a very important algorithms in the field of computer graphics, area fills, i.e. given a boundary of the area (which may be no boundary, but given the specified color), all pixel elements within the borders are modified to specify the color (or pattern fills). The most commonly used in the area fill, polygon fill, in this article, we discuss several polygon area fill algorithm.
To Search:
File list (Check if you may need any files):
Seed Filling.doc
Download