Menu

Question Discussion & Solution

MCQ
Q.
What is the relative speed improvement over Cohen-Sutherland algorithm for 2-D lines?

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.
The ideas of the Liang-Barsky algorithm are the same with which algorithm?
forum Discussion
MCQ
2.
Fast clipping algorithm is an example of ____________ clipping algorithm.
forum Discussion
MCQ
3.
If the logical AND of the endpoint codes is NOT zero, the line can be trivially accepted.
forum Discussion
MCQ
4.
When the line is parallel to the boundaries then what is the value of pk?
forum Discussion
MCQ
5.
The centre region of the screen and the window can be represented as________
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