Lecture04-PolygonScanConversion 计算机图形学ppt课件.ppt

区域填充的扫描线算法 算法步骤： 首先填充种子点所在扫描线上的位于给定区域的一个区段 然后确定与这一区段相连通的上、下两条扫描线上位于给定区域内的区段，并依次保存下来。 反复这个过程，直到填充结束。 (1)初始化：堆栈置空。将种子点（x，y）入栈。 (2)出栈：若栈空则结束。否则取栈顶元素（x，y），以y作为当前扫描线。 (3)填充并确定种子点所在区段：从种子点（x，y）出发，沿当前扫描线向左、右两个方向填充，直到边界。分别标记区段的左、右端点坐标为xl和xr。 (4)并确定新的种子点：在区间[xl，xr]中检查与当前扫描线y上、下相邻的两条扫描线上的象素。若存在非边界、未填充的象素，则把每一区间的最左象素作为种子点压入堆栈，返回第（2）步。 上述算法对于每一个待填充区段，只需压栈一次；因此，扫描线填充算法提高了区域填充的效率。 Barycentric Coordinates Consider a triangle defined by three points a, b, and c. Define a new coordinate system in which a is the origin, b and c define the coordinate system basis vectors Note that the coordinate system will be non-orthogonal. Barycentric Coordinates Barycentric Coordinates With this new coordinate system, any point can be written as: rearranging terms, we get: let then Barycentric Coordinates Barycentric Coordinates Now any point in the plane can be represented using its barycentric coordinates If then the point lies somewhere in the triangle Barycentric Coordinates If one of the coordinates is zero and the other two are between 0 and 1, the point is on an edge If two coordinates are zero and the other is one, the point is at a vertex. The barycentric coordinate is the signed scaled distance from the point to the line passing through the other two triangle points Computing Barycentric Coordinates To compute the barycentric coordinates of a point: Barycentric Coordinate Applet a c b b-a c-a b=0 b=-1 b=1 b=2 g = -1 g=0 g = 1 g = 2 a c b c-a b=0 b=-1 b=1 d=1 Global Edge Table Example For the given polygon: 0 1 2 3 4 5 6 7 8 0 1 2 3 4 5 6 7 8 a b c d e (a, b) = [(2, 1), (3, 5)] (b, c) = [(3, 5), (6, 6)] (c, d) = [(6, 6), (3, 8)] (d, e) = [(3, 8), (0, 4)] (e, a) = [(0, 4), (2, 1)] GET Entries (ymax, x@ymin, 1/m) (5, 2, ?) (6, 3, 3) (8, 6, -3/2) (8, 0, 3/4) (a, b) ? (b, c) ? (c, d) ? (d, e) ? (e, a) ? (4, 2, -2/3) Why don’t we store ymin Global Edge Table Example These entries are then placed into the ET based on the edge ymin values d 0 1 2 3 4 5 6 7 8 0 1 2 3 4 5 6