At first this dissertation discusses the limities of usual filling algorithms,finally presnets a new more effective algorithm of filling convex polygon,and explains in detail the algorithm applied in antialiasing.

• 本文首先讨论了几种常用的填充算法的局限性，然后提出了一种更有效的凸多边形填充算法，并详细说明了该算法在抗混叠。