Can’t find an answer?

Can’t find an answer?

Ask us to get the answer

  • This forum has 307 topics.

The Liang-Barsky algorithm is more efficient than the Cohen Sutherland algorithm.

(a) True

(b) False

I got this question in an interview for internship.

My enquiry is from Liang-Barsky Line Clipping topic in division 2D Transformation and Viewing of Computer Graphics

This algorithm uses the ____________ equations for a line and solves four inequalities.

(a) linear

(b) quadratic

(c) cubic

(d) parametric

This question was addressed to me in homework.

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

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

(a) True

(b) False

I got this question in an online quiz.

The doubt is from Liang-Barsky Line Clipping in division 2D Transformation and Viewing of Computer Graphics

The ideas of the Liang-Barsky algorithm are the same with which algorithm?

(a) Cyrus Beck algorithm

(b) Liam-Chopsky algorithm

(c) Cohen Sutherland algorithm

(d) All have the same

The question was posed to me in quiz.

The origin of the question is Liang-Barsky Line Clipping topic in division 2D Transformation and Viewing of Computer Graphics

The logical ______ of the endpoint codes determines if the line is completely inside the window.

(a) AND

(b) OR

(c) NOT

(d) NOR

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

Enquiry is from Cohen-Sutherland Line Clipping in section 2D Transformation and Viewing of Computer Graphics

Liang–Barsky algorithm is a __________ clipping algorithm.

(a) circle

(b) text

(c) line

(d) pixel

The question was posed to me in an online interview.

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

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

(a) True

(b) False

The question was asked in an interview for job.

This interesting question is from Cohen-Sutherland Line Clipping topic in chapter 2D Transformation and Viewing of Computer Graphics

The 4-bit code of bottom-right region of the window is ____________

(a) 1001

(b) 0101

(c) 1010

(d) 0110

I got this question in examination.

Query is from Cohen-Sutherland Line Clipping topic in division 2D Transformation and Viewing of Computer Graphics

The 4-bit code of top-left region of the window is ____________

(a) 1001

(b) 1100

(c) 0101

(d) 1010

This question was posed to me in exam.

This interesting question is from Cohen-Sutherland Line Clipping in section 2D Transformation and Viewing of Computer Graphics

If both codes are 0000, (bitwise OR of the codes yields 0000) line lies __________________ the window.

(a) completely outside

(b) half inside half outside

(c) completely inside

(d) can’t say anything

This question was posed to me in unit test.

My enquiry is from Cohen-Sutherland Line Clipping in section 2D Transformation and Viewing of Computer Graphics

Viewing 7 topics - 301 through 307 (of 307 total)

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