Following are the data structures used in Scan line algorithm to increase the efficiency.

Related MCQs

• 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
• The edges crossed by current scan line in Scan line polygon fill algorithm are called as
• 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)
• what will be the intersection points for current scan line as shown in figure using scan line polygon filling algorithm
• What will be the intersection points for current scan line as shown in figure using scan line polygon filling algorithm.
• In scan line polygon filling algorithm for current scan line the x-intersections got are 20,10,50,30. How pairing will be formed?
• In scan line polygon filling algorithm for current scan line the x-intersections obtained are 20,10,50,30. How these x-intersections are stored in intersection array?
• In scan line algorithm, Scan lines are processed in increasing (upward) / decreasing (downward) --------------------------.