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

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Computer Graphics

Q. In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside 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’

💬 Discuss

✅ Correct Answer: (A) store interaction point of line ps (s’) only

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

438

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

98%

Success Rate

Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics