The document outlines important computer graphics topics covered in 5 units. Unit 1 discusses raster and random scan systems, line drawing algorithms like Bresenham's and DDA, and filling algorithms. Unit 2 covers 2D transformations, coordinate systems, window-to-viewport transforms, and polygon clipping. Unit 3 introduces Bezier and B-Spline curves and surfaces as well as illumination models and polygon rendering. Unit 4 is similar to Unit 2 but for 3D, covering 3D transformations, view volumes, and projections. Unit 5 discusses key frame systems, motion specifications, back-face detection, and BSP trees and area subdivision methods.
The document outlines important computer graphics topics covered in 5 units. Unit 1 discusses raster and random scan systems, line drawing algorithms like Bresenham's and DDA, and filling algorithms. Unit 2 covers 2D transformations, coordinate systems, window-to-viewport transforms, and polygon clipping. Unit 3 introduces Bezier and B-Spline curves and surfaces as well as illumination models and polygon rendering. Unit 4 is similar to Unit 2 but for 3D, covering 3D transformations, view volumes, and projections. Unit 5 discusses key frame systems, motion specifications, back-face detection, and BSP trees and area subdivision methods.
The document outlines important computer graphics topics covered in 5 units. Unit 1 discusses raster and random scan systems, line drawing algorithms like Bresenham's and DDA, and filling algorithms. Unit 2 covers 2D transformations, coordinate systems, window-to-viewport transforms, and polygon clipping. Unit 3 introduces Bezier and B-Spline curves and surfaces as well as illumination models and polygon rendering. Unit 4 is similar to Unit 2 but for 3D, covering 3D transformations, view volumes, and projections. Unit 5 discusses key frame systems, motion specifications, back-face detection, and BSP trees and area subdivision methods.
2. Difference between raster and random scan system. 3. Bresenham’s and DDA Algorithm line drawing algorithms(problems). 4. midpoint circle algorithem. 5. boundary-fill and flood-fill algorithms.
Unit 2
1. Matrix representations of Translation, scaling, rotation, reflection and shear
transformations. 2. Transformations between coordinate systems. (y=mx+c) 3. window to view-port coordinate transformation. 4. Sutherland –Hodgeman polygon clipping algorithm.