Scribd
Upload
35 views1 page

March 2024

This document is an examination paper for a Computer Graphics course, consisting of four questions with various sub-questions. Students must choose to answer either Question 1 or 2, and either Question 3 or 4, with a total of 30 marks available. The questions cover topics such as line drawing algorithms, polygon filling algorithms, transformations, and the concepts of aliasing and anti-aliasing.

Uploaded by

4vxwnr5s6v
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
35 views1 page

March 2024

This document is an examination paper for a Computer Graphics course, consisting of four questions with various sub-questions. Students must choose to answer either Question 1 or 2, and either Question 3 or 4, with a total of 30 marks available. The questions cover topics such as line drawing algorithms, polygon filling algorithms, transformations, and the concepts of aliasing and anti-aliasing.

Uploaded by

4vxwnr5s6v
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/ 1

Total No. of Questions : 4] SEAT No.

8
23
PB37 [Total No. of Pages : 1

ic-
[6268]-231

tat
S.E. (Information Technology) (Insem)

7s
COMPUTER GRAPHICS

0:3
(2019 Pattern) (Semester - IV) (214453)

02 91
4:0
Time : 1 Hour] [Max. Marks : 30

0
41
6/0 13
Instructions to the candidates:
1) Answer Que.1 or Que.2, Que.3 or Que.4.
0
2) Neat diagrams must be drawn wherever necessary.
3/2
.23 GP

3) Figures to the right indicate full marks.


4) Assume suitable data, if necessary.
E
82

8
C

23
Q1) a) Consider a line from A (10, 10) to B (18, 15). Use Bresenham’s line

ic-
drawing algorithm to rasterize the line from A to B. Draw the pixel wise
16

tat
rasterization of Line. [8]
8.2

7s
b) What is computer graphics? Explain the concept of display file structure.
.24

0:3
[7]
91
OR
49

4:0
Q2) a) Consider a line from P (2, 3) to Q (7, 11). Use DDA line drawing
30
41

algorithm to resterize the line from P to Q. Draw the pixel wise rasterization
01
02

of Line. [8]
3/2
GP

b) What is aliasing and anti-aliasing? How aliasing effect is removed in vector


6/0

generation algorithm. [7]


CE
82

8
23
Q3) a) What are the steps involved in scan line polygon filling algorithm. [8]
.23

ic-
b) Apply the shearing transformation to square with given coordinates below.
16

tat
[7]
8.2

7s

A(0, 0), B(0, 3), C (3, 3), D (3, 0)


.24

0:3

i) Shear Parameter value of 0.7 relative to the line Y_ref = --1.


91
49

ii) Shear Parameter value of 0.7 relative to the line X_ref = --1.
4:0

OR
30
41

Q4) a) Apply following transformations on polygon A (10, 10), B (20, 40),


01
02

C (50, 40) D (40, 0) [8]


3/2
GP

i) Translation 10, 20 units along X & Y directions.


6/0

ii) Rotate 45 degrees about the origin.


CE

iii) Reflection against X-axis.


82

b) Explain concave and convex polygon with diagram. Explain even-odd


.23

method for testing a pixel inside or outside the polygon. [7]


16
8.2

  
.24
49

[6268]-231 1

You might also like