_______ is a ordered list of vertices where each vertex connected with the next in the list.

Related MCQs

• In an inside test if intersections point is a vertex and edges meeting at that vertex lies on same side of constructed horizontal line then the number of intersections are considered as ----------. Note : intersection point is a vertex
• In an inside test if intersections point is a vertex and edges meeting at that vertex lies on ------------- side of constructed horizontal line then the number of intersections are considered as even number . Note : intersection point is a vertex
• The edge table contains pointers back to the ______________ to identify vertices for each polygon edge.
• In an inside test if number of intersections are ---------------- then point is inside of the polygon. Note : intersection point is not a vertex.
• In an inside test if number of intersections is odd then point is ---------------- of the polygon. Note : intersection point is not a vertex
• Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111
• What will be clipped polygon vertices?
• 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.
• In 8 connected region by knowing one pixel we can get remaining ---------------- neighboring pixels.
• The 4-connected Polygon filling technique has disadvantage(s) as