Scribd
Upload
27 views2 pages

2017-Dec CSD-213 231

Uploaded by

ashkletron
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
27 views2 pages

2017-Dec CSD-213 231

Uploaded by

ashkletron
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

b. ueAk.

,c‘

NATIONAL INSTITUTE OF TECHNOLOGY, HAMIRPUR (HP)


END SEMESTER EXAMINATION, DECEMBER 2017

Branch: CSE ( HIT UNA & Dual Degree ) Semester:3"


Course Name: COMPUTER GRAPHICS Course Code: CSD-213
Max Marks: 60 Time: 3 Hrs.

Ql. Answer any one (5 marks),

a) Consider a line from (5, 5) to (13, 9). Use Bresenham's algorithm to rasterize the line.
b) Consider a circle centered at (50, 50) having radius 10. Use mid- point algorithm to rasterize

• the circle.

Q2. (6 x 3 marks = 18 marks)

a) Find the reflection of the point (4, 3) with respect to line 4x+2y-3=0?
b) Given the average time to execute any instruction in display program is 10 micro sec and
refresh rate is 30 fps, calculate the maximum number of instructions in the display program?

c) Given a raster system with resolution of 800 X 400 and refresh rate of 10 fps, calculate the
total no of horizontal retrace in one sec?

d) Consider the rectangle ABCD with co-ordinates A(1,1) B (4,1) C(4,4) D(1,4).We rotate the
rectangle counterclockwise direction by 45° fixing point B. Find the new coordinates of
resultant rectangle?

e) Find the RGB coordinates of a color at (0.2, 1, and 0.5) in CMY?


f) Let the co-ordinates of point in the real world are (5, 6). What are its coordinates in
viewport? (The Widow size is given in diagram for both real world and viewport)

10,10

4,4

Real World

2Q20

15,15
ViewPort
Q3. (4 x 3 marks = 12 marks)

Differentiate between the following:

a) Random and Raster Scan Display


b) Orthographic and Oblique projections
c) Diffused and Specular Reflection
d) Image space methods and Object space methods for Visible-surface detection

Q4. Answer any five (5 x 5 marks = 25 marks)

a) Consider a window (xmin, ymin) = (5, 5) and (xmax, ymax) = (10, 10) with line drawn from
(4, 15) to (8, 8). Apply Liang—Barsky algorithm to clip the given line against the given
window.

b) For the polygon given below apply both Sutherland Hodgeman, Weiler-Atherton Polygon
Clipping algorithms and compare the results obtained after clipping.

c) Explain area subdivision algorithms for hidden surface removal and apply the same on the
figure given below.

d) Explain z-buffer algorithm, stating its drawback? Describe in brief how A-buffer algorithm
overcomes this drawback?

e) Elaborate the intensity illumination model and explain how they are used in polygon
rendering?

f) What is Bezier curve? Explain its properties.

You might also like