BALLARI INSTITUTE OF TECHNOLOGY AND MANAGEMENT BALLARI

Department of Computer Science & Engineering

Assignment - 2
Submission Date: 07/06/2023
SUB: COMPUTER GRAPHICS AND VISUALIZATION (1 8CS62 ) SEM: VI A, B & C

1) Explain Scanline Polygon Filling Algorithm.

2) Define Translation, Scaling, Rotation, Reflection and Shearing Transformation in 2D and represent them
in Homogeneous Coordinate system.
3) Derive the Two Dimensional Pivot point Rotation equations and matrix.
4) Explain two dimensional fixed point scaling
5) A Square in a two dimensional system is defined by its vertices (5,5),(7,5),(7,7) ,(5,7).
a) Scale the Square by a factor of 2 about point (6, 6).
b) Rotate the original square by 450 in counter clockwise direction about (5, 5).
6) Write a OpengGL program to Create a cube and apply the OpengGL transformation functions on a cube.
7) Build the steps involved in transformation from a world coordinates window to screen coordinate to
viewport and also get the composite transformation matrix.
8) Derive the matrix representation for rotation of a point about an arbitrary axis in 3D space.
9) Obtain the composite transformation to rotate the three-dimensional object by 300 about an axis passes
through matrix the origin and point (5, 5, 5).

10) List and Explain different Types of Two dimensional geometric transformations Functions with an
examples and syntax and neat diagram.
11) Explain Cohen-Sutherland line clipping algorithm considering are all cases with Suitable example.
12) Write a OpenGL Program to create a cube and apply the OpenGL transformation functions on a cube
13) Show that Following Sequences Commute Consider 3D.
a) A Rotation and uniform Scaling. b) Two Rotations about the same axis.
14) Apply Cohen Sutherland line clipping algorithm to clip a line from starting point
(30, 15) and ending at point (65, 35) against the window having its lower left corner at (40, 10) and
upper right corner (75, 25).
15) Prove that two successive translations and rotations are additive in nature.
16) Explain Sutherland-Hodgeman Polygon line clipping algorithm considering all cases. Clip the following
polygons using Sutherland Hodgeman polygon clipping algorithm with neat sketches.

V1 A

V4
B
V2 C
E
V3
D