CORE

Computer Graphics

24CSO812 · S8 · 4 credits

Official KTU 2024 syllabus subject — study with practice, PYQs and AI tools.

§
Syllabus
Loading syllabus…
Manage →
⚡ DAY-BEFORE EXAM

Have an exam tomorrow?

Get a high-yield attack plan focused on maximum marks per minute. Zero fluff, strict PYQ priority, active recall, and trap avoidance.

Strategy: High-yield concepts + PYQs + weak areas

Tap a module to mark as weak
PRIORITY A
Module 1

Why:Foundation module

+ Mark Weak
PRIORITY A
Module 2

Why:High exam relevance

+ Mark Weak
PRIORITY B
Module 3

Why:Core module

+ Mark Weak
PRIORITY B
Module 4

Why:Applied concepts

+ Mark Weak
PRIORITY C
Module 5

Why:Standard exam coverage

+ Mark Weak
Modules
Module 01Introduction (9 hrs)expand

Basic concepts in Computer Graphics and its applications– Video Display devices- Refresh Cathode Ray Tubes, Random Scan Displays and systems, Raster scan displays and systems, Color CRT displays, Flat panel display and its categories.

Module 02Line and Circle Drawing and Polygon Filling Algorithms (6 hrs)expand

Line Drawing Algorithm- DDA, Bresenham’s algorithm – Circle Generation Algorithms –Mid point circle algorithm, Bresenham’s algorithm- Scan Conversion-frame buffers – solid area scan conversion – polygon filling algorithms

Module 032D transformations and Windowing concepts (8 hrs)expand

Two dimensional transformations. Homogeneous coordinate systems – matrix formulation and concatenation of transformations. Windowing concepts –Window to Viewport Transformation- Two dimensional clipping- Line clipping – Cohen Sutherland, Midpoint Subdivision algorithm.

Module 04Polygon Clipping (6 hrs)expand

Polygon clipping-Sutherland Hodgeman algorithm, Weiler-Atherton algorithm, Three dimensional object representation-Polygon surfaces, Quadric surfaces – Basic 3D transformations.

Module 05Projections and Visible surface detection methods (7 hrs)expand

Projections – Parallel and perspective projections – vanishing points. Visible surface detection methods– Back face removal- Z-Buffer algorithm, A-buffer algorithm, Depth-sorting method, Scan line algorithm.

Notes / Resources

Exam-focused notes are optional context — Continue Learning above works even without them.

Notes for this subject aren't written yet

Continue Learning above adapts to this subject anyway — it teaches from your active syllabus.