COMPUTER SCIENCE AND ENGINEERING
COMPUTER GRAPHICS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
ywmin = y = ywmax
|
|
|
xwmin > x > xwmax
|
|
|
xwmin = x = xwmax
|
|
|
xwmin < x < xwmax
|
Detailed explanation-1: -For a point to be clipped, which of the following conditions must be satisfied by the point? Explanation: A point P(x, y) is NOT clipped if x is more than the minimum value of x and less than the maximum value of x. Mathematically, it can be written as “xwmin ≤ x ≤ xwmax“.
Detailed explanation-2: -Abhishek Mishra. Answer: d Clarification: In polygon clipping, first the polygon is clipped against the left edge of the polygon window to get new vertices of the polygon. So, it is the top left which is clipped first.
Detailed explanation-3: -4. Which of the following polygon clipping algorithm can be used to clip a filled area? Explanation: Weiler Atherton Clipping algorithm helps us to clip a filled area. The filled area may be a convex polygon or concave polygon.