COMPUTER GRAPHICS

Paper Code: 
CBCA 503
Credits: 
3
Periods/week: 
3
Max. Marks: 
100.00
Objective: 

The course will enable the students to

  1. Learn how computer graphics are used in different application areas.
  2. To introduce the use of the components of a graphics system and become familiar with building approach of graphics system components and algorithms.

 

Course Outcomes (COs):

 

Learning Outcome (at course level)

 

Learning and teaching strategies

Assessment Strategies

CO 193 Describe the concepts of computer graphics.

CO 194 Analyze the Computer Graphics Software and line algorithms.

CO 195 Evaluate and Create the programme based on 2D Geometric structure, matrix design and Fill algorithm.

CO 196 Implement 2D & 3D viewing concepts in different shapes.

CO 197 Explain  2D Transformation concepts.

Interactive Lectures, Discussion, Tutorials, Reading assignments, Demonstrations, Team teaching, Teaching using advanced IT audio-video tools, G-suite.

Class test, Semester end examinations, Quiz, Solving problems in tutorials, Assignments, Presentation, Individual and group projects and peer review.

 

9.00
Unit I: 

Introduction to Computer Graphics: Definition, Application areas of Computer Graphics, Graphical user interface.

Overview of Graphics Systems: Video Display devices: Refresh Cathode Ray Tubes, Random scan displays, Raster scan displays, Color CRT monitors, Direct View Storage Tubes, Flat Panel displays, Raster Scan Systems, Random Scan Systems.

 

 

9.00
Unit II: 

Graphics Software: Coordinate representations, Graphics Functions, Software Standards, and PHIGS Workstations.

Output Primitives: Points and Lines, Simple use of line equation, DDA Algorithm, Bresenham’s Line Algorithm, Circle Generating Algorithms: Properties of Circles, 8-way Symmetry, Bresenham’s Circle drawing algorithm, Midpoint Circle Algorithm. Introduction to anti-aliasing.

 

 

9.00
Unit III: 

Filled Area Primitives: Scan-Line Polygon Fill Algorithm, Inside –Outside Tests, Boundary Fill Algorithm, Flood Fill Algorithm.

Two Dimensional Geometric Transformations: Basic Transformations, Matrix Representations and Homogeneous Transformations, Composite Transformations, Other Transformations: Reflection, Shear. Introduction to 3-D Transformation

 

9.00
Unit IV: 

Two-Dimensional Viewing: Viewing Pipeline, Viewing Coordinate Reference Frame, Window-to-Viewport Coordinate Transformation.

Line Clipping: Cohen-Sutherland Line Clipping, Midpoint Subdivision method.

 

9.00
Unit V: 

Visible-Surface Detection Methods: Classification of Visible Surface, Back Face Detection,

Depth Buffer Method, Area Subdivision Method.

Three-Dimensional Display Methods: Parallel Projection, Perspective Projection.

 

ESSENTIAL READINGS: 

1. D. Hearn & M. P.Baker, “Computer Graphics”, Prentice Hall of India, 2002.

 

REFERENCES: 

     1.Krisnamurthy N, “Introduction to Computer Graphics”, Tata Mc Graw Hill Edition

2.Zhigang X. & Plastock R.A., “Theory and Problems of Computer Graphics”, Schaum’s Outline, Tata McGraw Hill Edition

3.Foley J.D.& Dam A.Van, “Fundamentals of Interactive Computer Graphics”, Addison-Wesley.

4.Ralf Skinmetz and Klana Naharstedt, “Multimedia: Computing, Communications and Applications”, Pearson Education, 2001

 

 

Academic Year: 
2020-21
  • Printer-friendly version