计算机图形学（英文）cg10-04.ppt

Generalization * Angel: Interactive Computer Graphics 5E ? Addison-Wesley 2009 - d = Dx(b-a) d is an integer d 0 use upper pixel d 0 use lower pixel * Angel: Interactive Computer Graphics 5E ? Addison-Wesley 2009 Scan Conversion = Fill How to tell inside from outside Convex easy Nonsimple difficult Odd even test Count edge crossings Winding number odd-even fill * Angel: Interactive Computer Graphics 5E ? Addison-Wesley 2009 Fill at end of pipeline Convex Polygons only Nonconvex polygons assumed to have been tessellated Shades (colors) have been computed for vertices (Gouraud shading) Combin