Menu

Question Discussion & Solution

MCQ

Q.

Liang-Barsky clipping algorithm computes _______ number of intersections than NLN line clipping.

A

more

B

less

C

same

D

can

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

Liang Barsky algorithm can be used to clip 3-D lines.

A

True

B

False

C

n>

Discussion

MCQ

2.

A polygon can be clipped using clipping operations.

A

True

B

False

C

n>

Discussion

MCQ

3.

If the logical AND of the endpoint codes is NOT zero, the line can be trivially accepted.

A

True

B

False

C

n>

Discussion

MCQ

4.

The centre region of the screen and the window can be represented as________

A

0000

B

1111

C

0110

D

1001

Discussion

MCQ

5.

Fast clipping algorithm is an example of ____________ clipping algorithm.

A

text

B

polygon

C

line

D

curve

Discussion

More Computer Graphics Topics

Computer Graphics Basics

93 MCQs

2D Transformation

28 MCQs

Graphics Hardware

31 MCQs

Region filling and clipping

51 MCQs

3D Transformation

10 MCQs

Computer Vision

10 MCQs

Curve and surface design

20 MCQs

Graphics Attributes

57 MCQs