Syllabus - COMPUTER GRAPHICS (AG404)

COMPUTER GRAPHICS (AG404)

UnitI

Introduction to Raster scan displays, Storage tube displays, Pixel, Frame buffer, Vector & Character generation, Random Scan systems, Display devices, Scan Conversion techniques refreshing, flickering, interlacing, colour monitors, working of different types of printers , working principles of keyboard, mouse scanner, digitizing camera, track ball, tablets and joysticks, graphical input techniques, positioning techniques, rubber band techniques, dragging etc.

Unit II

Line Drawing algorithms: simple DDA, Bresenham’s Algorithm, Circle Drawing Algorithms: Midpoint Circle drawing and Bresenham’s Algorithm, Polygon fill algorithm: Boundary-fill and Flood-fill algorithms.

UnitIII

2-D Transformation: Translation, Rotation, Scaling, Shearing, Reflection. Inverse Transformation, Homogeneous coordinate system, Matrices Transformation, Composite Transformation. Windowing & Clipping: World Coordinate System, Screen Coordinate System, Viewing Transformation, Line Clipping & Polygon Clipping Algorithms

UnitIV

3-D Transformations: Translation, Rotation and Scaling. Parallel & Perspective Projection: Types of Parallel & Perspective Projection, Hidden Surface elimination: Depth comparison, Back face detection algorithm, Painter’s Algorithm, Z-Buffer Algorithm. Curve generation, Bezier and B-spline methods. Basic Illumination Model: Diffuse reflection, Specular reflection, Phong Shading, Gouraud shading, Ray Tracing, Color models like RGB, YIQ, CMY, HSV.

UnitV

Visualization: Visualization of 2D/3D scalar fields: color mapping, ISO surfaces. Direct volume data rendering: ray-casting, transfer functions, segmentation. Visualization of Vector fields and flow data, Time-varying data, High-dimensional data: dimension reduction, parallel coordinates, Non-spatial data: multi-variate, tree/graph structured, text Perceptual and cognitive foundations, Evaluation of visualization methods, Applications of visualization, Basic Animation Techniques like traditional, key framing

Course Objective

The objectives of this course is to enable the students to implement various shapes drawing algorithms and apply geometric transformations on graphic objects and also implement clipping, shading and color models

Course Outcome

["Understand the core concepts of computer graphics.", "Implement various shapes drawing algorithms.", "Apply geometric transformations on graphic objects and also implement clipping", "Perform activities involved in design, development and testing of modeling, rendering, shading", "Perform visualization tasks"]

Practicals

  • Write a program to implement DDA line drawing algorithm

  • Write a program to implement Bresenham’s line drawing algorithm.

  • Write a program to implement Bresenham’s circle drawing algorithm.

  • Write a program to draw an ellipse using Bresenham’s algorithm.

  • Write a program to perform various transformations on line , square & rectangle.

  • Write a program to implement Cohen Sutherland line clipping algorithm.

  • Write a program to implement Liang-Bersky line clipping algorithm.

  • Write a program to implement Cohen-Sutheland polygon clipping algorithm to clip a polygon with a Pattern.

  • Write a program to convert a color given in RGB space to it’s equivalent CMY color space.

Reference Books

  • Donald Hearn and M.P. Becker “Computer Graphics” Pearson Pub.

  • Foley, Van Dam, Feiner, Hughes, “Computer Graphics: Principles and Practice” AddisonWesley

  • Rogers, "Procedural Elements of Computer Graphics", Tata McGraw Hill

  • Maurya, “Computer Graphics with Virtual Reality System “ , Wiley India

  • Pakhira,”Computer Graphics ,Multimedia & Animation”,PHI learning