Computer Graphics Mock Test

1. An -------------test is used to check whether a point is inside or outside of the polygon.

2. Following is the method for inside test of the polygon.

3. We can express 2D transformations as _________ matrix operators.

4. the desired characteristic of line is/are.

5. When two molecules move apart, which effect on molecular shapes_________.

6. In 8 connected region by knowing one pixel we can get remaining ---------------- neighboring pixels.

7. the desired characteristic of line is/are

8. The further the line from the projection plane, _______its image on the projection plane

9. Scan line polygon filling algorithm starts from

10. Scan line polygon filling algorithm can be used for filling Convex polygon.

11. Scan line Fill Approach works at the

12. The perspective projection is more practical because the distant objects appear _________.

13. The edges crossed by current scan line in Scan line polygon fill algorithm are called as

14. Which of the following is true about scan line algorithm?

15. Active edge table is used in following algorithm

16. the horizontal and vertical lines drawn by line drawing algorithm are

17. ___________ procedure accepts the coordinates of an internal point.

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

19. Reflections are equivalent to _________

20. A line drawn in the background color is

21. In perspective projection eye of the viewer is placed at the _.

22. The algorithm used for filling the interior of a polygon is called

23. The object refers to the 3D representation through linear, circular or some other representation are called ___________

24. The edge table contains pointers back to the ______________ to identify vertices for each polygon edge.

25. In scan line algorithm the intersection points are

26. Scan-line coherence property is used in

27. The process of coloring the area of a polygon is called

28. In Bresenham's algorithm, while generating a circle , it is easy to generate?

29. We can express 3D transformations as _________ matrix operators

30. Bresanham circle algorithm uses the approach of

31. Even-odd method of inside test counts ----- to decide the position of a point.

32. In an inside test if number of intersections are ---------------- then point is inside of the polygon. Note : intersection point is not a vertex.

33. A line can be represented by

34. Seed pixel in flood fill Algorithm is an

35. In an inside test if number of intersections is odd then point is ---------------- of the polygon. Note : intersection point is not a vertex

36. Boundary fill algorithm uses -------- call to the fill function.

37. A position in plane known as

38. Even-odd method of inside test is suitable for------

39. In Boundary Fill method ____________ Data Structure is used.

40. The side effect of scan conversion are

41. The distance of a line from the projection plane determines ___________

42. The total of the winding no. in winding number method of inside test is called as

43. In --------------algorithm edges can be specified in different color.

44. Scan line polygon filling algorithm uses series of ____ To fill the polygon.

45. Every side in winding number method has given a number called

46. The process of reducing aliasing is called

47. If the pixel is already filled with desired color then does nothing, otherwise fills it. This is called

48. _____________ is an example of affine transformation.

49. Inside tests of polygon are useful in --------

50. The 4-connected Polygon filling technique has disadvantage(s) as