Menu

Question Discussion & Solution

MCQ
Q.
How many inequalities are solved in this algorithm?

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Cohen Sutherland clipping algorithm computes _______ number of intersections than NLN line clipping.
forum Discussion
MCQ
2.
The centre region of the screen and the window can be represented as________
forum Discussion
MCQ
3.
These areas are given names depending on the location of ___________________
forum Discussion
MCQ
4.
A polygon can be clipped by using the Nicholl-Lee-Nicholl algorithm.
forum Discussion
MCQ
5.
O algorithm is simple and easy to implement.
forum Discussion

category More Computer Graphics Topics

article

Computer Graphics Basics

format_list_bulleted 93 MCQs
Practice arrow_forward
article

2D Transformation

format_list_bulleted 28 MCQs
Practice arrow_forward
article

Graphics Hardware

format_list_bulleted 31 MCQs
Practice arrow_forward
article

Region filling and clipping

format_list_bulleted 51 MCQs
Practice arrow_forward
article

3D Transformation

format_list_bulleted 10 MCQs
Practice arrow_forward
article

Computer Vision

format_list_bulleted 10 MCQs
Practice arrow_forward
article

Curve and surface design

format_list_bulleted 20 MCQs
Practice arrow_forward
article

Graphics Attributes

format_list_bulleted 57 MCQs
Practice arrow_forward