COMPUTER SCIENCE AND ENGINEERING
COMPUTER GRAPHICS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
(50, 50)
|
|
|
(50, 32.50)
|
|
|
(36.67, 32.50)
|
|
|
(36.67, 36.67)
|
Detailed explanation-1: -Clipping window The general equation of a line, y = m * x + c, is used, where m is the gradient and c is the y-intercept. End points of the line segment are A = ( x[0], y[0] ) and B = ( x[1], y[1] ). Most of the line clipping algorithms are based on Cohen-Sutherland and Liang-Barsky algorithms.
Detailed explanation-2: -Point clipping tells us whether the given point X, Y is within the given window or not; and decides whether we will use the minimum and maximum coordinates of the window. The X-coordinate of the given point is inside the window, if X lies in between Wx1 ≤ X ≤ Wx2.
Detailed explanation-3: -So, clipping is a procedure that identifies those portions of a picture that are either inside or outside of our viewing pane. In case of point clipping, we only show/print points on our window which are in range of our viewing pane, others points which are outside the range are discarded.
Detailed explanation-4: -In computer graphics, line clipping is the process of removing (clipping) lines or portions of lines outside an area of interest (a viewport or view volume). Typically, any part of a line which is outside of the viewing area is removed.