(2½ hours)

Total Marks: 75

N. B.: (1) All questions are compulsory.

(2) Makesuitable assumptions wherever necessary and state the assumptions made.
(3) Answers to the same question must be written together.
(4) Numbers to the right indicate marks.
(5) Draw neat labeled diagrams wherever necessary.
(6) Use of Non-programmable calculators is allowed.

1. Attempt any three of the following: 1

5
a. What is Computer Graphics? How image is to be display on Video Display Device?

Computer graphics is an art of drawing pictures on computer screens with the

help of programming. It involves computations, creation, and manipulation of data.
In other words, we can say that computer graphics is a rendering tool for the
generation and manipulation of images.
Video Display Device Cathode Ray Tube
The primary output device in a graphical system is the video monitor. The main
element

of a video monitor is the Cathode Ray Tube (CRT), shown in the following
illustration.

The operation of CRT is very simple −

• The electron gun emits a beam of electrons (cathode rays).

• The electron beam passes through focusing and deflection systems that direct
it

towards specified positions on the phosphor-coated screen.

• When the beam hits the screen, the phosphor emits a small spot of light at

each position contacted by the electron beam.

• It redraws the picture by directing the electron beam back over the same

screen points quickly.

 There are two ways (Random scan and Raster scan) by which we can display an
object

on the screen.

b. Explain the method of circle drawing using Midpoint Circle Algorithm.

The equation of circle is X2+Y2=r2,X2+Y2=r2, where r is radius.

c. Distinguish between Active and Passive graphics device.

d. Explain the problems of aliasing with example.

Points to be coverd.
1.Jagged Profiles
2.Improperly rendering
3.Disintegrating textures.
e. Explain different types of Video Formats.
 List of formats.
• AVI (Audio Video Interleave) ...
• FLV (Flash Video Format) ...
• WMV (Windows Media Video) ...
• MOV (Apple QuickTime Movie) ...
• MP4 (Moving Pictures Expert Group 4)

f. Explain the Acceptance and Rejection test using bit codes in Cohen-Sutherland line
clipping algorithm.

The Cohen-Sutherland line clipping algorithm quickly detects and dispenses with
two common and trivial cases. To clip a line, we need to consider only its endpoints.
If both endpoints of a line lie inside the window, the entire line lies inside the
window. It is trivially accepted and needs no clipping. On the other hand, if both
endpoints of a line lie entirely to one side of the window, the line must lie entirely
outside of the window. It is trivially rejected and needs to be neither clipped nor
displayed.

Inside-Outside Window Codes

To determine whether endpoints are inside or outside a window, the algorithm sets
up a half-space code for each endpoint. Each edge of the window defines an infinite
line that divides the whole space into two half-spaces, the inside half-space and
the outside half-space, as shown below.

As you proceed around the window, extending each edge and defining an inside
half-space and an outside half-space, nine regions are created - the eight "outside"
regions and the one "inside"region. Each of the nine regions associated with the
window is assigned a 4-bit code to identify the region. Each bit in the code is set to
either a 1(true) or a 0(false). If the region is to the left of the window, the first bit of
the code is set to 1. If the region is to the top of the window, the second bit of the
code is set to 1. If to the right, the third bit is set, and if to the bottom,
the fourth bit is set. The 4 bits in the code then identify each of the nine regions as
shown below.
For any endpoint ( x , y ) of a line, the code can be determined that
identifies which region the endpoint lies. The code's bits are set according
to the following conditions:

The sequence for reading the codes' bits is LRBT (Left, Right, Bottom, Top).

Once the codes for each endpoint of a line are determined, the
logical AND operation of the codes determines if the line is completely outside of
the window. If the logical AND of the endpoint codes is not zero, the line can be
trivally rejected. For example, if an endpoint had a code of 1001 while the other
endpoint had a code of 1010, the logical AND would be 1000 which indicates the
line segment lies outside of the window. On the other hand, if the endpoints had
codes of 1001 and 0110, the logical AND would be 0000, and the line could not be
trivally rejected.

The logical OR of the endpoint codes determines if the line is completely inside the
window. If the logical OR is zero, the line can be trivally accepted. For example, if
the endpoint codes are 0000 and 0000, the logical OR is 0000 - the line can be
trivally accepted. If the endpoint codes are 0000 and 0110, the logical OR is 0110
and the line can not be trivally accepted.

Before Clipping
 1. Consider the line segment AD.

Point A has an outcode of 0000 and point D has an outcode of 1001. The
logical AND of these outcodes is zero; therefore, the line cannot be trivally
rejected. Also, the logical OR of the outcodes is not zero; therefore, the line
cannot be trivally accepted. The algorithm then chooses D as the outside
point (its outcode contains 1's). By our testing order, we first use the top edge
to clip AD at B. The algorithm then recomputes B's outcode as 0000. With
the next iteration of the algorithm, AB is tested and is trivially accepted and
displayed.

2. Consider the line segment EI

Point E has an outcode of 0100, while point I's outcode is 1010. The results
of the trivial tests show that the line can neither be trivally rejected or
accepted. Point E is determined to be an outside point, so the algorithm clips
the line against the bottom edge of the window. Now line EI has been
clipped to be line FI. Line FI is tested and cannot be trivially accepted or
rejected. Point F has an outcode of 0000, so the algorithm chooses point I as
an outside point since its outcode is1010. The line FI is clipped against the
window's top edge, yielding a new line FH. Line FH cannot be trivally
accepted or rejected. Since H's outcode is 0010, the next iteration of the
algorthm clips against the window's right edge, yielding line FG. The next
iteration of the algorithm tests FG, and it is trivially accepted and display.

After Clipping

After clipping the segments AD and EI, the result is that only the
line segment AB and FG can be seen in the window.
2. Attempt any three of the following: 1
5
a. Perform mapping from Window to Viewport coordinate transformation.
b. Using homogeneous coordinate transformation matrix, apply following sequence of
transformation to
a unit square centered at origin.
i)Translation by factor(1,1)
ii)Rotation by angle θ=90̊

TT = 1 0 0
0 1 0
1 1 1

TR= cos90 sin90 0 0 1 0

-sin90 cos90 0 = -1 0 0

0 0 1 0 0 1

T=TT . TR = 0 1 0

-1 0 0

-1 1 1
 Unit square ABCD=
A -1/2 -1/2 1

B 1/2 -1/2 1
=
C 1/2 1/2 1

D -1/2 1/2 1

Calculate A',B',C',D' Multiply T with Unit square

A'=(-1/2,1/2) ,B'=(-3/2,3/2) ,C'=(-3/2,3/2), D'=(-3/2,1/2)

c. Obtain the general combined matrix for scaling about an Fixed Point P(xf, yf).

scaling with respect to a selected fixed position (x f , yf ), when we have a function

that can scale relative to the coordinate origin only. This sequence is
1. Translate the object so that the fixed point coincides with the coordinate origin.

T(x f , yf ) · S(sx, sy) ·T(−x f , −yf ) = S(x f , yf , sx, sy)

d. Write a note on Affine and perspective geometry.
e. Explain Projection with the help of Orthographic projection.
Viewing 3D objects on a 2D display requires a mapping from 3D to 2D
• A projection is formed by the intersection of certain lines (projectors) with the
view plane
• Projectors are lines from the center of projection through each point in the object.
_ This is known as plane geometric projection
f. Shear a unit cube situated at origin with a shear transformation matrix:

1 1.5 3 0
0.8 0 1 0
Tshear = 0.5 1 1 0
0 0 0 1
 Soution
A 0 0 1 1
B 1 0 1 1
C 1 1 1 1
D 0 1 1 1
V= E = 0 0 0 1
F 1 0 0 1
G 1 1 1 1
H 0 1 0 1

To find output:Multiply V'=V.Tshear

3. Attempt any three of the following: 1

5
a. What is Viewing? Explain Canonical View Volume.

The primary use of clipping in computer graphics is to remove objects, lines, or line
segments that are outside the viewing pane. The viewing transformation is insensitive
to the position of points relative to the viewing volume − especially those points
behind the viewer − and it is necessary to remove these points before generating the
view.

View Volume
• Given the specification of the view window, we can set up a View Volume.• Only
objects inside the view volume might appear in the display, the rest are clipped.

Canonical View Volumes

• Canonical View Space: A cube, with the origin at the center, the viewer looking
down –z, x to the right, and y up
Canonical View Volume is the cube: [-1,1]×[-1,1]×[-1,1]
Variants (later) with viewer looking down +z and z from 0-1
Only things that end up inside the canonical volume can appear in the window

b. Explain camera model and viewing pyramid with diagram.

c. Explain different properties of BRDF.

Points to be covered:
• Domain
• Range
• Reciprocity
 • Energy Conservation

d. Write a note on Photometry.

e. Explain Grassmann’s laws.

f. Explain color with the help of colorimetry.

Colorimetry is the science of color measurement and description. Since color is

ultimately a human response, color measurement should begin with human

4. Attempt any three of the following: 1

5
a. Explain Z-buffer algorithm with advantages and disadvantages.
 Disadvantages
• It requires large memory.
• It is time consuming process

b. What are the basic tests in Warnock's algorithm? Explain.

c. Explain Parametric representation of Ellipse with example.

d. Write a note on B-Spline Curves.

e. Compare all visible surface detection methods.

f. Construct Bezier curve of order 3,with 4 polygon vertices A(1,1) B(2,3) C(4,3) D(6,4)
for values of u,0≤u≤1where p(u) is a point on curve with vales for u=(0,1/4,1/2,3/4,1).

Solution
The equation for curve is
P(u)=(1-u)3P1+3u(1-u)2P2+3u2(1-u)P3+u3P4

5. Attempt any three of the following: 1

5
a. What is an Image? Explain different file formats of an image.
An image is a visual representation of something. In information technology, the
term has several usages: An image is a picture that has been created or copied and
stored in electronic form. An image can be described in terms of vector
graphics or raster graphics. An image stored in raster form is sometimes called
 a bitmap. An image map is a file containing information that associates different
locations on a specified image with hypertext links.
Formats:
• JPEG
• GIF
• PNG
• BMP
• TIFF ,etc...

b. Explain Animation with Character Animation.

computer animation generally refers to any time sequence of visual changes in a picture.
In addition to changing object positions using translations or rotations, a computer-
generated animation could display time variations in object size, color, transparency,
or surface texture. Advertising animations often transition one object shape into
another: for example, transforming a can of motor oil into an automobile engine. We
can also generate computer animations by varying camera parameters, such as
position, orientation, or focal length, and variations in lighting effects or other
parameters and procedures associated with illumination and rendering can be used to
produce computer animations.

Character animation is a specialized area of the animation process, which involves

bringing animated characters to life. The role of a Character Animator is analogous
to that of a film or stage actor, and character animators are often said to be "actors
with a pencil" (or a mouse). Character animators breathe life in their characters,
creating the illusion of thought, emotion and personality. Character animation is
often distinguished from creature animation, which involves bringing photo-
realistic animals and creatures to life.
c. Explain the concept of median filtering with example.
d. Distinguish Key frame animation with Procedural animation.

Key frame animation

Procedural Animation

e. Explain different types of deformation.

• Bone Deformer(skeleton deformation)

• Curve Deformer(Skinning deformation)

f. Explain JPEG Compression process in detail.