Course Content

Other Courses

Tribhuvan university CSIT 2074 Syllabus Computer Graphics

Computer Graphics - Syllabus

Course Overview and Structure
Syllabus Notes Old Questions Unit Wise Questions Question Bank

Embark on a profound academic exploration as you delve into the Computer Graphics course (CG) within the distinguished Tribhuvan university's CSIT department. Aligned with the 2074 Syllabus, this course (CSC209) seamlessly merges theoretical frameworks with practical sessions, ensuring a comprehensive understanding of the subject. Rigorous assessment based on a 60 + 20 + 20 marks system, coupled with a challenging passing threshold of , propels students to strive for excellence, fostering a deeper grasp of the course content.

This 3 credit-hour journey unfolds as a holistic learning experience, bridging theory and application. Beyond theoretical comprehension, students actively engage in practical sessions, acquiring valuable skills for real-world scenarios. Immerse yourself in this well-structured course, where each element, from the course description to interactive sessions, is meticulously crafted to shape a well-rounded and insightful academic experience.


Course Description: The course coversconcepts of graphics hardware, software, and

applications,data structures for representing 2D and 3D geometric objects, drawing algorithms

for graphical objects, techniques for representing and manipulating geometric objects,

illumination and lighting models, and concept of virtual reality.


Course Objectives: The objective of this course is to understand the theoretical foundation as

wellas the practical applications of 2D and 3D graphics.


Units

1.1 A Brief Overview of Computer Graphics, Areas of Applications.

1.2 Graphics Hardware: Display Technology, Architecture of Raster-Scan

Displays,Vector Displays, Display Processors, Hard copy device. Input Devices.

1.3 Graphics Software: Software standards, Need of machine independent graphics

language.


Key Topics

  • Scan Converting a Point and a Straight Line
    SC-1

    This topic covers the scan conversion of a point and a straight line using algorithms such as DDA Line Algorithm and Bresenham's Line Algorithm.

  • Scan Converting Circle and Ellipse
    SC-2

    This topic covers the scan conversion of circle and ellipse using Mid Point Circle and Ellipse Algorithm.

  • Area Filling
    SC-3

    This topic covers various area filling algorithms including Scan Line Polygon fill Algorithm, Inside-outside Test, Scan line fill of Curved Boundary area, Boundary-fill and Flood-fill algorithm.

3.1 Two-Dimensional translation, Rotation, Scaling, Reflection and Shearing

3.2 Homogeneous Coordinate and 2D Composite Transformations. Transformation

between Co-ordinate Systems.

3.3 Two Dimensional Viewing: Viewing pipeline, Window to viewport coordinate

transformation

3.4 Clipping: Point, Lines(Cohen Sutherland line clipping, Liang-Barsky Line Clipping) ,

Polygon Clipping(Sutherland Hodgeman polygon clipping)


4.1 Three-Dimensional translation, Rotation, Scaling, Reflection and Shearing

4.2 Three-Dimensional Composite Transformations

4.3 Three-Dimensional Viewing: Viewing pipeline, world to screen viewing

transformation, Projection concepts(Orthographic, parallel, perspective projections)


5.1  Representing Surfaces: Boundary and Space partitioning

5.1.1 Polygon Surface: Polygon tables , Surface normal and Spatial orientation of surfaces, Plane equations, Polygon meshes
5.1.2 Wireframe Representation
5.1.3 Blobby Objects
5.2 Representing Curves: Parametric Cubic Curves, Spline Representation, Cubic spline interpolation, Hermite Curves, Bezier and B-spline Curve and surface
5.3 Quadric Surface: Sphere and Ellipsoid

Key Topics

  • Sweep, Boundary and Spatial-Partitioning Representation
    SO-6.1

    This topic covers the sweep, boundary, and spatial-partitioning representation methods used in solid modeling. It explains how these methods are used to create and manipulate 3D objects.

  • Binary Space Partition Trees (BSP)
    SO-6.2

    This topic introduces Binary Space Partition Trees (BSP), a data structure used in solid modeling to efficiently represent and manipulate 3D objects. It explains how BSP trees are constructed and used in various applications.

  • Octree Representation
    SO-6.3

    This topic covers the octree representation method used in solid modeling. It explains how octrees are used to efficiently represent and manipulate 3D objects, and their applications in computer graphics.

7.1 Image Space and Object Space Techniques

7.2 Back Face Detection, Depth Buffer (Z-buffer), A-Buffer and Scan-Line Algorithms.

7.3 Depth Sorting Method (Painter’s Algorithm)

7.4 BSP tree Method, Octree and Ray Tracing


8.1 Basic Illumination Models: Ambient light, Diffuse reflection, Specular reflection and

Phong model

8.2 Intensity attenuation and Color consideration ,Transparency, Shadows

8.3 Polygon Rendering Methods : Constant intensity shading, Gouraud shading , Phong

Shading and Fast Phong Shading


9.1 Concept of Virtual reality

9.2 Virtual Reality Components of VR System, Types of VR System, 3D Position

Trackers, Navigation and Manipulation Interfaces

9.3 Application of VR


1.1 Introduction, Callback functions, Color commands, Drawings pixels, lines, polygons

using OpenGL, Viewing and Lighting


Lab works

Laboratory Works:

Students should be able to write program on the most of the contents listed in syllabus, using any

known programming language (C, C++) in previous semester. Majorly, students should on

computer graphics primitives like line, circle and ellipse drawing algorithm to hidden surface

removal techniques. After completing the basic lab session the students must be able to design

some project works like game, 3D rotation, screen saver etc. Some sample lab sessions can be as

following:-

Unit 2 : Scan Conversions Algorithm (10 Hours)

  • Study of Fundamental Graphics Functions
  • Implementation of Line drawing algorithms: DDA Algorithm, Bresenham's Algorithm
  • Implementation of Circle drawing algorithms: Bresenham's Algorithm, Mid-Point Algorithm

Unit 3 : Two-Dimensional Geometric Transformations ( 4 Hours)

  • Simulation of 2D transformation, Rotation and Scaling
  • Write a program to implement Cohen Sutherland line clipping algorithm

Unit 4 : Three-Dimensional Geometric Transformation (12 Hours)


  • Write a program to perform shear transformation on a rectangle
  • Write a program to perform 2D Transformation on a line
  • 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
  • Write a program to draw a cube using in build library function and perform 3D transformations

              Translations in x, y, z directions

              Rotation by angle 450 about z axis, rotation by 600 about y-axis in succession.

              Scaling in x-direction by a factor of 2, scaling in y- direction by a factor of 3


Unit 5 : 3D Objects Representation ( 4 Hours)

  • Implementation of polygon tables.
  • Write a program to draw Bezier curve, sphere


Unit 7 : Visible Surface Detections (10 Hours)

  • Back face detection:- Implementation of Depth Buffer, A – Buffer, Scan-Line algorithm
  • Implementation of rotation of 3D cube.


Unit 10 : Introduction to OpenGL (5 Hours)

  • Event driven programming
  • Point, Line and Polygon
  • Drawing 3D objects