Active edge table is used in following algorithm

Related MCQs

• The edge table contains pointers back to the ______________ to identify vertices for each polygon edge.
• In scan line algorithm, Let an edge is represented by Formula y = mx + b and for scan_line s value of y = s. What will be the Xs ? Note : Scan line is intersecting with edge at (s,Xs)
• The seed fill algorithm for filling polygon is classified as ________ fill algorithm and _______ fill algorithm.
• One edge of the polygon has coordinates (10,20) and (15,40). In scan line polygon filling at the ith step x-value of the intersection point of the scan line ‘i’ and above mentioned edge is 12. What will be the x-value of the intersection point of the scan line in i+1 th step?
• One edge of the polygon has coordinates (10,20) and (15,40). In scan line polygon filling at the ith step x-value of the intersection point of the scan line ‘i’ and above mentioned edge is 14. What will be the x-value of the intersection point of the scan line in i+1 th step?
• When the current scan line in Scan line polygon fill algorithm moves above the upper / below the lower endpoint, the edge
• Which polygon clipping algorithm executed by clipping all polygon edges against the viewing screen edges one viewing screen edge at a time?
• In scan line algorithm, using Edge coherence property the next incremental x-intersection(xs+1) can be calculated as: ------------Note: Xs is the previous x-intersection.
• Scan line fill algorithm is more efficient than flood fill algorithm.
• floating point algorithm in DDA algorithm is……..