Scribd
Upload
14 views2 pages

UCS505

Uploaded by

ankitbhardwaj1743
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views2 pages

UCS505

Uploaded by

ankitbhardwaj1743
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Roll Number:

Thapar Institute of Engineering & Technology, Patiala


Computer Science & Engineering Department
MID SEMESTER EXAMINATION
B. E. (3rd Year) Course Code: UCS505
Course Name: Computer Graphics
Date: 19th March 2024
Time: 2 Hours, M. Marks: 25 Faculty: Anupam Garg, Amrita Kaur,
Kuntal Choudhary, Harpreet Singh,
Yadwinder Singh, BV Raghav
Note: All questions are compulsory. Attempt the subparts of the question at one
place.
1(a) Calculate the time spent in scanning each row of pixels in a raster system of resolution
680 X 420 and a refresh rate of 50 frames per second. (2)

(b) Differentiate between Raster and Random Scan System on the basis of resolution, line
drawing and realism in display. (3)

2(a) Find the condition under which we can switch the order of a rotation and a
simultaneous shearing and still get the same result. (3)

(b) Reflect the diamond shaped polygon whose vertices are A (-1, 0), B(0, -2), C(1, 0) and
D (0, 2) about the vertical line x=2. (2)

3 (a) There is a rectangular window with lower left-hand corner (-3,1) and upper right-hand
corner (2,6). There are lines AB having coordinates (-4,2) and (-1,7), CD having
coordinates (-2,3) and (1,2) and EF having coordinates (1, -2) and (3,3). Use the
Cohen Sutherland algorithm to clip the specified lines. (3)

(b)
Subject polygon Clip polygon

t
Starting Vertex

Use the Weiler-Atherton algorithm to the clip the polygon shown in the above figure
. by mentioning the list contents and the process in detail. (2)

4(a)
r
P2
Fri.

P4
Apply the non-zero winding number rule on the points P1 to P4 to specify the
position of the points. (2)

(b) Find the complete viewing transformation that maps the window in world coordinates
with x extent 5 to 15 and y extent 5 to 15 onto a viewport with x extent 1/2 to 3/2 and y
extent 0 to 1/4 in normalized device space and then maps the workstation window with
x extent 1/2 to 3/2 and y extent '/2 to '/4 in the normalized device space into a
workstation viewport with x extent 5 to 15 and y extent 5 to 15 on the physical display
device. (3)

5(a) Derive the formula(e) for Bresenham's method and thus compute the points on the
line-segment PQ (P=[210,202]; Q1194,210]), starting at P. (2+2)

(b) Starting with P=(a,0) to draw an ellipse with respective semi axes 'a' and `b'; when
does the mid-point algorithm terminate. (1)

You might also like