Abstract: Region filling algorithm is widely used in drawing, but the arbitrary polygon nested region
filling algorithm is very difficult to achieve, in order to solve this problem, puts forward new area
filling algorithm that based on equidistant parallel lines. Firstly, draw a set of parallel lines use the
same intervals. Secondly, calculation the intersection that all parallel lines with arbitrary nesting the
polygon. Finally, use the interval value as a parameter sub block of size, each line contains the
parallel calculation of the number of blocks and coordinates and filling, completion of the entire
region filling at last. In the process of the experiment, solve the problem of computing in intersection
of the nested polygons with the parallel lines is solved. Use multi group data through the application
of independent design show that the algorithm can quickly and accurately complete any number of
nested polygon area filling and explain the technical difficulties and algorithm complexity which arise
in the process of experiment.

Key words: equal spaced parallel lines, interior point, multiple nesting, area filling, sub block