Computer Science · Computer Graphics
कौन सा पॉलीगॉन क्लिपिंग एल्गोरिदम अवतल बहुभुजों (concave polygons) को संसाधित कर सकता है और ऐसा आउटपुट दे सकता है जो कई अलग-अलग बहुभुजों में विभाजित हो जाता है?
- 1लियांग-बार्सकी (Liang-Barsky)
- 2निकोल-ली-निकोल (Nicholl-Lee-Nicholl)
- 3सदरलैंड-हॉजमैन (Sutherland-Hodgman)
- 4वाइलर-अथर्टन (Weiler-Atherton)✓
सही उत्तर देखें
वाइलर-अथर्टन (Weiler-Atherton)
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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
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