The matrix representation for rotation in homogeneous coordinates is(a) P’=T+P(b) P’=S*P(c) P’=R*P(d) P’=dx+dyThis question was posed to me in an internship interview.My doubt stems from Matrix Representations and Homogeneous Coordinates topic in chapter 2D Transformation and Viewing of Computer Graphics

The matrix representation for rotation in homogeneous coordinates is(a

1.	The matrix representation for rotation in homogeneous coordinates is(a) P’=T+P(b) P’=SP(c) P’=RP(d) P’=dx+dyThis question was posed to me in an internship interview.My doubt stems from Matrix Representations and Homogeneous Coordinates topic in chapter 2D Transformation and Viewing of Computer Graphics
Answer» The correct choice is (C) P’=RP Easy explanation: The MATRIX representation for ROTATION is P’=RP.

Discussion

No Comment Found

Related InterviewSolutions

One of the drawbacks of Sutherland- Hodgeman algorithm is that it can’t produce ____________ areas.(a) connected(b) multiple(c) discrete(d) circularThis question was addressed to me during an internship interview.I'd like to ask this question from Sutherland-Hodgeman Polygon Clipping in portion 2D Transformation and Viewing of Computer Graphics
In a convex polygon, each of the interior angles is less than ____degrees.(a) 90(b) 180(c) 360(d) 45I have been asked this question in an online interview.Asked question is from Sutherland-Hodgeman Polygon Clipping in division 2D Transformation and Viewing of Computer Graphics
If we used Left->Right->Up->Bottom, the final output will be the vertex list outputted by the ___________ edge.(a) left edge(b) right edge(c) top edge(d) bottom edgeThis question was addressed to me in an interview for internship.My question comes from Sutherland-Hodgeman Polygon Clipping topic in division 2D Transformation and Viewing of Computer Graphics
If the subject polygon is concave at vertices outside the clipping polygon, the new polygon may have coincident edges.(a) True(b) FalseI had been asked this question in examination.My question is based upon Sutherland-Hodgeman Polygon Clipping in section 2D Transformation and Viewing of Computer Graphics
How many edges of the clipping are/is present in 2D?(a) 1(b) 2(c) 3(d) 4The question was posed to me in examination.I'm obligated to ask this question of Sutherland-Hodgeman Polygon Clipping topic in division 2D Transformation and Viewing of Computer Graphics
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 edgeI 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) FalseI 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) 1I 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 sideThis 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 clippingI 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

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment