21UCS501 COMPUTER GRAPHICS L T P C

3 0 0 3
OBJECTIVES
• To introduce the fundamental concepts of Computer Graphics.
• To impart the knowledge of 2D and 3D geometric Transformations and algorithms.
• To acquire the knowledge of Color & Shading Models and Curves & Surfaces.
• To know the Advance Topics of Computer Graphics.

UNIT I Introduction to Computer graphics 9

Output Primitives- Attributes of output primitives – Basic Raster Graphics- Introduction and Line
Generation- Points and lines, Line drawing algorithms – DDA Line Drawing Algorithm and Bresenham’s
Line Drawing Algorithm – Line Clipping Algorithm – Cohen Sutherland Clipping algorithm.
UNIT II 2D and 3D Geometric Transformations 9
Transformations: Basic transformation, Matrix representations and homogenous coordinates, Composite
transformations, Reflections and shearing. Three Dimensional: 3-D Geometric Primitives, 3-D Object
representations, 3-D Transformations - 3-D Clipping - Elementary 3D Graphics: Plane projections and its
types, Vanishing points, Specification of a 3D view- OpenGL Primitives.
UNIT III Curves and Surface Design 9
Introduction to Curve – Curve Continuity – Piecewise Curve Design – Parametric Curve Design - Spline
Curve Representation, Bezier Curves, B-Spline Curves, Fractals and its applications. Introduction to
Surfaces- Bilinear Surfaces, Ruled Surfaces, Coons Patch, Sweep Surfaces, Quadric surfaces, Bezier
Surfaces, B-Spline Surfaces, Spheres, Blobby objects- Visible Surface identification.
UNIT VI Color Models and Shading Models 9
Color Models- RGB,CMYK ,YIQ,HSV,HLS – Light Modeling Techniques- Illumination Model- Shading
Models- Flat Shading, Polygon Mesh Shading, Phong shading, Gouraud shading, interpolative shading
model- Texture and Object Representation, Shadows and background, Photo-realistic rendering.
UNIT V Advanced Topics 9
Graphics and human perception- Introduction of Rendering, Ray tracing, Ray Casting, Antialiasing,
Radiosity, Computer Animation-Design of animation sequence, general computer animation functions,
raster animation, Computer animation languages, key frame systems, motion specifications, Procedural
Animation, Key-Frame Animation vs. Procedural Animation, Morphing, Three-Dimensional Morphing.
TOTAL – 45 Periods
Course Outcomes:

After the completion of the course, the student will be able to

1. Explain the basics of Computer graphics and its applications.
2. Apply computer graphics concepts in the development of information visualization, business
applications and Computer games.
3. Analyze various algorithms for processing the data and image effectively.
4. Evaluate the realism of wide range of computer graphics techniques for assessing its value in
graphical applications.
5. Create a graphics application programs using different graphical techniques to make a realistic
scene.
6. Work with a team to prepare a video or film that to display in the given specifications.
TEXT BOOKS:
1. Donald Hearn and M.Pauline Baker, “Computer Graphics”, Second Edition, PHI/Pearson
Education.

2. Zhigand xiang, Roy Plastock, Schaum’s outlines, “Computer Graphics Second Edition”,
Tata McGrawhill edition.

3. C. Foley, VanDam, Feiner and Hughes, “Computer Graphics Principles & Practice”,
Second Edition,Pearson Education

REFERENCE BOOKS:

1. W. M. Newman, R. F. Sproull – “Principles of Interactive computer Graphics” – Tata

McGraw Hill.

2. Donald Hearn and M Pauline Baker, “Computer Graphics with OpenGL”, Pearson
education

3. Computer Graphics, R. K. Maurya, John Wiley.

4. Mathematical elements of Computer Graphics, David F. Rogers, J. Alan Adams, Tata

McGraw-Hill.

5. Procedural elements of Computer Graphics, David F. Rogers, Tata McGraw-Hill.

6. http://web.cs.wpi.edu/~emmanuel/courses/cs563/S07/talks/cs563_intro.pdf
21UCS508 L T P C
COMPUTER GRAPHICS LABORATORY
0 0 2 1
OBJECTIVES:
• To implement various algorithms and Transformations
• To Perform animations using animation software

LIST OF EXPERIMENTS
1. Implement DDA Algorithm (incremental scan conversion algorithm) for drawing a line segments
between two given end points A (x1, y1) and B(x2, y2).Implementation of Line Clipping
Algorithms.
2. Implement Bresenham’s line drawing algorithm for drawing a line segment between two given
endpoints A(x1, y2) and B(x2, y2).
3. Apply 2D Transformation to change the square shaped object into diamond shape.
4. Write a program to implement Cohen Sutherland line clipping algorithm.
5. Apply the 3D transformation to translate and rotate the 3D-BAR of angle 175 degree along Y-
axis.
6. Draw a simple house using inbuilt graphics function and brighten the house using RGB Colors.
7. Write a program to draw a car using in-build graphics function and translate it from bottom left
corner to right bottom corner of screen.
8. Construct a fractal and display the name of the fractal that you have drawn on your window
9. Create an animation to indicate a ball bouncing on steps using any animation software.
10. Perform an animation of Solar System using any animation software.
TOTAL: 30 Periods
COURSE OUTCOMES:
After successful completion of this course, the students will be able to:
• Apply the concepts of transformations and Clipping for a given application. (Apply)
• Analyze various techniques to develop a graphical application for a given scenario. (Analyze)
• Design graphical application for a given real life scenario using the concepts of OpenGL
Primitives etc. (Create)
• Communicate effectively to justify the computing solutions based on legal and ethical principles.
(Affective domain)
• Work effectively as an individual or in teams to develop graphical application for a given
scenario. (Affective domain)

HARDWARE AND SOFTWARE REQUIRMENTS

HARDWARE REQUIREMENTS:
Personal Computers – 30 Numbers
SOFTWARE REQUIREMENTS:
Operating System: Windows
Any C++ compiler compatible with Windows, Animation Software etc..