Computer Science · Computer Graphics
What is a major limitation of the Sutherland-Hodgman polygon clipping algorithm?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Generates extra edges for convex subject polygons
- 2Generates extra/spurious edges for concave subject polygons✓
- 3Cannot clip lines against rectangular viewports
- 4Only works on circular clipping boundaries
Correct answer
Generates extra/spurious edges for concave subject polygons
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Computer Graphics MCQs →Want more practice questions on Computer Graphics?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Computer Graphics