Can’t find an answer?

Can’t find an answer?

Ask us to get the answer

  • This forum has 307 topics.

We can correctly clip a polygon by processing the polygon boundary as a whole against each ___________

(a) side wall

(b) top edge

(c) window edge

(d) bottom edge

I had been asked this question in an interview.

This intriguing question comes from Sutherland-Hodgeman Polygon Clipping topic in division 2D Transformation and Viewing of Computer Graphics

The process is repeated iteratively for each clip polygon side, using the output list from one stage as the input list for the next.

(a) True

(b) False

I got this question in an international level competition.

My question is based upon Sutherland-Hodgeman Polygon Clipping in portion 2D Transformation and Viewing of Computer Graphics

How many polygons are used in this method?

(a) 4

(b) 3

(c) 2

(d) 1

I have been asked this question during an online interview.

My question comes from Sutherland-Hodgeman Polygon Clipping in chapter 2D Transformation and Viewing of Computer Graphics

Only vertices from the subject polygon that are on the _______________ are selected.

(a) lower half

(b) boundary

(c) opaque side

(d) visible side

This question was addressed to me by my school teacher while I was bunking the class.

This interesting question is from Sutherland-Hodgeman Polygon Clipping in chapter 2D Transformation and Viewing of Computer Graphics

Sutherland-Hodgeman clipping is an example of_________________ algorithm.

(a) line clipping

(b) polygon clipping

(c) text clipping

(d) curve clipping

I had been asked this question in an online quiz.

My enquiry is from Sutherland-Hodgeman Polygon Clipping topic in section 2D Transformation and Viewing of Computer Graphics

Fast clipping algorithm has similarities with Liam Barsky algorithm.

(a) True

(b) False

I have been asked this question by my college professor while I was bunking the class.

Enquiry is from Line Clipping Using Non Rectangular Clip Windows topic in section 2D Transformation and Viewing of Computer Graphics

Fast clipping algorithm is an example of ____________ clipping algorithm.

(a) text

(b) polygon

(c) line

(d) curve

I have been asked this question by my college professor while I was bunking the class.

The above asked question is from Line Clipping Using Non Rectangular Clip Windows in chapter 2D Transformation and Viewing of Computer Graphics

The polygon is assumed to be _____________ and vertices are ordered clockwise or anti-clockwise while applying line clipping algorithms.

(a) cylindrical

(b) concave

(c) plane

(d) convex

I have been asked this question in an online interview.

My doubt stems from Line Clipping Using Non Rectangular Clip Windows in section 2D Transformation and Viewing of Computer Graphics

A plane duality is a map from a ______________________ to its dual plane.

(a) projective plane

(b) incident plane

(c) parallel plane

(d) reference plane

I got this question at a job interview.

This key question is from Line Clipping Using Non Rectangular Clip Windows topic in division 2D Transformation and Viewing of Computer Graphics

O algorithm is simple and easy to implement.

(a) True

(b) False

This question was addressed to me in an interview for job.

This interesting question is from Line Clipping Using Non Rectangular Clip Windows in portion 2D Transformation and Viewing of Computer Graphics

Viewing 15 topics - 256 through 270 (of 307 total)

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