M

Mr. Dubey • 100.69K Points
Coach

Q. In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should

  • (A) store interaction point of line ps (s’) only
  • (B) store point p and s’
  • (C) store point p only
  • (D) store points s and s’
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. In 4 connected region if one pixel is (2,3) then remaining neighboring pixels are

Q. Loss tangent approximates _________.

Q. Which of the following capacitors will have the least variation ?

Q. What is the formula for output voltage for Buck converter?

Q. A large aperture means antenna gain will be__________.

Q. The pin is used to select direct command word

Q. 2's complement representation of a 16-bit number (one sign bit and 15 magnitude bits) is FFF1. Its magnitude in decimal representation is ?

Q. The Boolean expression Y = AB + (A + B)(A’ + B) may be simplified as ?

Q. Which of the following noise must be considered at high frequencies (microwave frequencies) ?

Q. With increase in firing angle

Question analytics