Computer Graphics
Course Code: CSE2710
L-T-P : 3-0-0 Credit Units: 03
Course Objective:
The objective of the course is to provide the understanding of the fundamental graphical operations and the implementation on computer, the mathematics behind computer graphics, including the use of spline curves and surfaces. It gives the glimpse of recent advances in computer graphics, user interface issues that make the computer easy, for the novice to use.
Course Contents:
Module I: Introduction to Graphics and Graphics Hardware System
Application of computer graphics, Video Display Devices, Raster Scan Display, Random Scan Display, Input Devices, Graphic Software and graphics standards, Numerical based on Raster and Random scan display, Frame buffer, Display processor.
Module II: Output Primitives and Clipping operations
Algorithms for drawing 2D Primitives lines (DDA and Bresenham‘s line algorithm), circles (Bresenham‘s and midpoint circle algorithm), Antialiasing and filtering techniques. Line clipping (cohen-sutherland algorithm), Curve clipping algorithm, and polygon clipping with Sutherland Hodgeman algorithm, Area fill algorithms for various graphics primitives: Scanline fill algorithm, boundary fill algorithm, flood fill algorithm, Polygon representation, various method of Polygon Inside test: Even-Odd method, winding number method, Character generation techniques.
Module III: 2D Geometric transformation
2D Transformation: Basic transformation, Translation, Rotation, Rotation relative to an arbitrary point, scaling, Matrix Representations and Homogeneous coordinates, window to viewport transformation.
Module IV:3D Geometric transformation
3D Concepts: Parallel projection and Perspective projection, 3D Transformations, composite 3D transformation, co-ordinate transformation, Inverse transformation
Module V: Object modeling and Visible Surface detection
Fractal geometry methods, fractal dimensions, Geometric construction of deterministic self-similar fractals, Iterated function system to generate fractals. Bezier curves and Bezier surfaces, Bspline curves and surfaces, Visible surface detection method: Basic illumination, diffuse reflection, specular reflection, shadows. Ray tracing method, Depth-buffer method, A-buffer method, Depth-sorting method (painter‘s algorithm), Binary search partition method, Scan line method,
Module VI: Introduction to multimedia
Design of animation sequences, Computer Animation languages, Elementary filtering techniques and elementary Image Processing techniques, graphics library functions used in animation design
Examination Scheme:
Components |
A |
CT |
S/V/Q |
HA |
EE |
Weightage (%) |
5 |
10 |
8 |
7 |
70 |
CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester Examination; Att: Attendance
Text & References:
Text:
- Foley et. al., “Computer Graphics Principles & practice”, 2^{nd} ed. AWL, 2000.
- D. Hearn and P. Baker, “Computer Graphics”, Prentice Hall, 1986.
- R. Plastock and G. Kalley, “Theory and Problems of Computer Graphics”, Schaum’s Series, McGraw Hill, 1986
References:
- R.H. Bartels, J.C. Beatty and B.A. Barsky, “An Introduction to Splines for use in Computer Graphics and Geometric Modeling”, Morgan Kaufmann Publishers Inc., 1987.
- C.E. Leiserson, T.H. Cormen and R.L. Rivest, “Introduction to Algorithms”, McGraw-Hill Book Company, 1990.
- W. Newman and R. Sproul, “Principles of Interactive Computer Graphics, McGraw-Hill, 1973.
- F.P. Preparata and M.I. Shamos, “Computational Geometry: An Introduction”, Springer-Verlag New York Inc., 1985.
- D. Rogers and J. Adams, “Mathematical Elements for Computer Graphics”, MacGraw-Hill International Edition, 1989
- David F. Rogers, “Procedural Elements for Computer Graphics”, McGraw Hill Book Company, 1985.
- Alan Watt and Mark Watt, “Advanced Animation and Rendering Techniques”, Addison-Wesley, 1992