210251: COMPUTER GRAPHICS
Teaching Scheme Examination Scheme
Lectures: 3 Hrs/week Theory: 100 Marks
Prerequisite: Data Structures and Algorithms (Subject Code: 210244)
To understand basic concepts of computer graphics
To understand algorithms to draw various graphics primitives
To understand 2-D and 3-D transformations
Introduction to computer graphics, lines, line segments, vectors, pixels and frame buffers, vector generation, DDA and Bresenham’s line and circle drawing algorithms, antialiasing, thick lines, character generation: Stroke Principle, Starburst Principle, Bit map method, display of frame buffer.
Graphics Primitives: Display devices, Interactive devices: Tablets, touch panels, mouse, joysticks, track balls, light pen etc., Data generating devices: Scanners and digitizers, primitive operations, display file structure, algorithms and display file interpreter, Text and line styles. (6 Hrs)
Introduction, representation, entering Polygons, Polygon filling: Seed fill, Edge fill, scan conversion algorithm, filling with patterns.
Introduction, matrices, Scaling, Rotation, homogeneous coordinates, Translation, Co-ordinate transformation, rotation about an arbitrary point, inverse transforms and shear transforms.
Introduction, segment table, segment creation, deletion, renaming. Image transformations, raster techniques
Windowing and clipping
Introduction, viewing transforms, 2D clipping, Cohen-Sutherland outcode algorithm, Polygon Clipping, Sutherland-Hodgman algorithm, Generalized clipping. (6 Hrs)
Introduction, 3-D geometry, primitives, transformations, Rotation about an arbitrary axis, Concept of parallel and perspective projections, Viewing parameters, 3D clipping, 3D viewing transformations (6 Hrs)
Hidden Surfaces and Lines
Introduction, Back-face removal algorithm, Z buffers, scan-line, Painters algorithm, Warnock algorithm, hidden line methods, binary space partition.