M

Mr. Dubey • 100.69K Points
Coach

Q. In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside the window and S ( Previous point) lies outside 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 nothing
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. An AND gate can be imagined as ?

Q. Electric intensity at any point in an electric field is equal to the at that point.

Q. If string1=john,and string2=Rivers are merged,the process is called

Q. Which of the following is not an 8086/8088 general-purpose register?

Q. Which of the following circuit is not used in a digital frequency meter ?

Q. For a p-channel FET, What is the direction of current flow ?

Q. A clipping window has coordinates as A(50,10), B(80,10), C(80,40), D(50,40). A line segment has end coordinates (40,15) and (75,45). What will be the

Q. Unipolar modulation is generally used in

Q. (9AF27)16 + (ABCD4)16 = (-)16 ?

Q. In low-power applications, ideal SWR is___________.

Question analytics