CG Theory Syllabus
Uploaded by
eshanijain16CG Theory Syllabus
Uploaded by
eshanijain16Course Code Course Name Credits
CSC305 Computer Graphics 3
Prerequisite: Knowledge of C Programming and Basic Mathematics.
Course Objectives
1 To equip students with the fundamental knowledge and basic technical competence in the
field of Computer Graphics.
2 To emphasize on implementation aspect of Computer Graphics Algorithms.
3 To prepare the student for advance areas and professional avenues in the field of Computer
Graphics
Course Outcomes: At the end of the course, the students should be able to
1 Describe the basic concepts of Computer Graphics.
2 Demonstrate various algorithms for basic graphics primitives.
3 Apply 2-D geometric transformations on graphical objects.
4 Use various Clipping algorithms on graphical objects
5 Explore 3-D geometric transformations, curve representation techniques and projections
methods.
6 Explain visible surface detection techniques and Animation.
Module Detailed Content Hours
1 Introduction and Overview of Graphics System: 02
1.1 Definition and Representative uses of computer graphics, Overview of
coordinate system, Definition of scan conversion, rasterization and
rendering.
1.2 Raster scan & random scan displays, Architecture of raster graphics
system with display processor, Architecture of random scan systems.
2 Output Primitives: 10
2.1 Scan conversions of point, line, circle and ellipse: DDA algorithm and
Bresenham algorithm for line drawing, midpoint algorithm for circle,
midpoint algorithm for ellipse drawing (Mathematical derivation for
above algorithms is expected)
2.2 Aliasing, Antialiasing techniques like Pre and post filtering, super
sampling, and pixel phasing).
2.3 Filled Area Primitive: Scan line Polygon Fill algorithm, inside outside
tests, Boundary Fill and Flood fill algorithm.
3 Two Dimensional Geometric Transformations 6
3.1 Basic transformations: Translation, Scaling, Rotation
3.2 Matrix representation and Homogeneous Coordinates
3.3 Composite transformation
3.4 Other transformations: Reflection and Shear
4 Two-Dimensional Viewing and Clipping 7
4.1 Viewing transformation pipeline and Window to Viewport coordinate
transformation
4.2 Clipping operations: Point clipping, Line clipping algorithms: Cohen-
Sutherland, Liang: Barsky, Polygon Clipping Algorithms: Sutherland-
Hodgeman, Weiler-Atherton.
Three Dimensional Geometric Transformations, Curves and
5 8
Fractal Generation
5.1 3D Transformations: Translation, Rotation, Scaling and Reflection
5.2 Composite transformations: Rotation about an arbitrary axis
5.3 Projections – Parallel, Perspective. (Matrix Representation)
5.4 Bezier Curve, B-Spline Curve, Fractal-Geometry: Fractal Dimension,
Koch Curve.
6 Visible Surface Detection and Animation 6
6.1 Visible Surface Detection: Classification of Visible Surface Detection
algorithm, Back Surface detection method, Depth Buffer method, Area
Subdivision method
6.2 Animation: Introduction to Animation, Traditional Animation
Techniques, Principles of Animation, Key framing: Character and
Facial Animation, Deformation, Motion capture
Textbooks:
1 Hearn & Baker, “Computer Graphics C version”, 2nd Edition, Pearson Publication
2 James D. Foley, Andries van Dam, Steven K Feiner, John F. Hughes, “Computer Graphics
Principles and Practice in C”, 2ndEdition, Pearson Publication
3 Samit Bhattacharya, “Computer Graphics”, Oxford Publication
References:
1 D. Rogers, “Procedural Elements for Computer Graphics”, Tata McGraw-Hill Publications.
2 Zhigang Xiang, Roy Plastock, “Computer Graphics”, Schaum‟s Outlines McGraw-Hill
Education
3 Rajesh K. Maurya, “Computer Graphics”, Wiley India Publication.
4 F. S. Hill, “Computer Graphics using OpenGL”, Third edition, Pearson Publications.
Assessment:
Internal Assessment:
Assessment consists of two class tests of 20 marks each. The first-class test is to be conducted
when approx. 40% syllabus is completed and second class test when additional 40% syllabus is
completed. Duration of each test shall be one hour.
End Semester Theory Examination:
1 Question paper will comprise of 6 questions, each carrying 20 marks.
2 The students need to solve total 4 questions.
3 Question No.1 will be compulsory and based on entire syllabus.
4 Remaining question (Q.2 to Q.6) will be selected from all the modules
Useful Links
1 https://www.classcentral.com/course/interactivegraphics-2067
2 https://swayam.gov.in/nd2_ntr20_ed15/preview
3 https://nptel.ac.in/courses/106/106/106106090/
4 https://www.edx.org/course/computer-graphics-2
