Can’t find an answer?

Can’t find an answer?

Ask us to get the answer

  • This forum has 307 topics.

The area around the clipping window is divided into a number of different ______________

(a) pixels

(b) squares

(c) areas

(d) lines

This question was addressed to me in a national level competition.

This question is from Nicholl-Lee-Nicholl Line Clipping topic in portion 2D Transformation and Viewing of Computer Graphics

A polygon can be clipped by using the Nicholl-Lee-Nicholl algorithm.

(a) True

(b) False

I had been asked this question in an interview for job.

This interesting question is from Nicholl-Lee-Nicholl Line Clipping topic in portion 2D Transformation and Viewing of Computer Graphics

Cohen Sutherland clipping algorithm computes _______ number of intersections than NLN line clipping.

(a) more

(b) less

(c) same

(d) can’t be predicted

This question was posed to me by my college director while I was bunking the class.

The query is from Nicholl-Lee-Nicholl Line Clipping in portion 2D Transformation and Viewing of Computer Graphics

What is full form of NLN line clipping algorithm?

(a) Nicholl-Liang-Nicholl algorithm

(b) Nicholai-Liang-Nicholl algorithm

(c) Nicholai-Lee-Nicholl algorithm

(d) Nicholl-Lee-Nicholl algorithm

This question was addressed to me by my college professor while I was bunking the class.

The query is from Nicholl-Lee-Nicholl Line Clipping topic in section 2D Transformation and Viewing of Computer Graphics

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

(a) more

(b) less

(c) same

(d) can’t be predicted

The question was asked in quiz.

The question is from Nicholl-Lee-Nicholl Line Clipping in section 2D Transformation and Viewing of Computer Graphics

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

(a) 40%

(b) 50%

(c) 70%

(d) 36%

I had been asked this question during an online exam.

My question comes from Liang-Barsky Line Clipping topic in chapter 2D Transformation and Viewing of Computer Graphics

How many inequalities are solved in this algorithm?

(a) 3

(b) 2

(c) 1

(d) 4

The question was asked in a national level competition.

This is a very interesting question from Liang-Barsky Line Clipping topic in chapter 2D Transformation and Viewing of Computer Graphics

When pk < 0, then the line is ___________

(a) parallel to the boundaries

(b) exceeding the boundaries

(c) bounded inside the boundaries

(d) can’t say

I have been asked this question during an interview for a job.

Asked question is from Liang-Barsky Line Clipping in chapter 2D Transformation and Viewing of Computer Graphics

Which type of arithmetic is used in Liang Barsky algorithm?

(a) simple arithmetic operations

(b) floating point arithmetic

(c) fixed point arithmetic

(d) logarithmic operations

I had been asked this question by my school teacher while I was bunking the class.

The query is from Liang-Barsky Line Clipping topic in portion 2D Transformation and Viewing of Computer Graphics

When the line is parallel to the boundaries then what is the value of pk?

(a) pk < 0

(b) pk > 0

(c) pk = 0

(d) pk = 1

I have been asked this question during an interview.

This interesting question is from Liang-Barsky Line Clipping topic in section 2D Transformation and Viewing of Computer Graphics

Viewing 15 topics - 286 through 300 (of 307 total)

1 2 3 19 20 21
  • You must be logged in to create new topics.