Home / Engineering / Computer Graphics MCQs / Page 6

Computer Graphics MCQs | Page - 6

Dear candidates you will find MCQ questions of Computer Graphics here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 51.47K Points
Coach

Q. 51) Winding number method always gives correct answer for overlapping polygons

(A) true
(B) false
(C) ---
(D) ---
View Answer Discuss Share

M

Mr. Dubey • 51.47K Points
Coach

Q. 52) Inside tests of polygon are useful in --------

(A) polygon filling
(B) line coloring
(C) shadowing
(D) none of the above
View Answer Discuss Share

M

Mr. Dubey • 51.47K Points
Coach

Q. 53) Even-odd method of inside test counts ----- to decide the position of a point.

(A) edges
(B) vertices
(C) intersections
(D) pixels
View Answer Discuss Share

M

Mr. Dubey • 51.47K Points
Coach

Q. 54) In winding number method an ------------------ edges ------ considered

(A) horizontal , not
(B) vertical , not
(C) slanted , not
(D) horizontal , is
View Answer Discuss Share

M

Mr. Dubey • 51.47K Points
Coach

Q. 55) Even-odd method of inside test is suitable for------

(A) polygons
(B) circles
(C) lines
(D) all of above
View Answer Discuss Share

M

Mr. Dubey • 51.47K Points
Coach

Q. 56) In winding number method an edge can have winding number as -----

(A) zero
(B) +1 or -1
(C) only +1
(D) only -1
View Answer Discuss Share

M

Mr. Dubey • 51.47K Points
Coach

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

(A) flood fill algorithm
(B) boundary fill algorithm
(C) scan line polygon filling algorithm
(D) none of these
View Answer Discuss Share

M

Mr. Dubey • 51.47K Points
Coach

Q. 58) The algorithm used for filling the interior of a polygon is called

(A) flood fill algorithm
(B) boundary fill algorithm
(C) scan line polygon fill algorithm
(D) none of these
View Answer Discuss Share

M

Mr. Dubey • 51.47K Points
Coach

Q. 59) ___________ procedure accepts the coordinates of an internal point.

(A) area fill
(B) boundary fill.
(C) line fill.
(D) scan fill.
View Answer Discuss Share

M

Mr. Dubey • 51.47K Points
Coach

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

(A) 8
(B) 4
(C) 2
(D) 16
View Answer Discuss Share