📊 Computer Graphics
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
💬 Discuss
✅ Correct Answer: (D) store nothing

You must be Logged in to update hint/solution

💬 Discussion

Related MCQs

Q. Octal coding involves grouping of bits in ?

Q. at a point is equal to the negative potential gradient at that point.

Q. The input current waveform of a bridge controlled rectifier when the load is perfectly filtered is

Q. 8255 has -------- i/o pins

Q. An ideal diode is

Q. A 4 KHz signal is to be sent line using 10 bit PCM, the bit rate on the line is ?

Q. If the sign bit of mantissa is 0 and the exponent is increased from a positive to a more negative number the result is

Q. The keyword used to transfer control from a function back to the calling function is

Q. Sutherland – Hodgman algorithm is used for _______________.

Q. The clipping window is mapped into a

📊 Question Analytics

👁️
848
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
83%
Success Rate