# MSc (Mathematics and Computing) Programme:Computer Graphics

Thapar UniversityPrice on request

Price on request

£ 295 - (Rs 24,052)

+ VAT

Price on request

Price on request

## Important information

- Master
- Patiala

Starts | Location |
---|---|

On request |
PatialaThapar University P.O Box 32, 147004, Punjab, India See map |

## Course programme

Semester I

Real Analysis – I

Linear Algebra

Complex Analysis

Fundamentals of Computer Science and C Programming

Discrete Mathematical Structure

Differential Equations

Semester II

Real Analysis –II

Advanced Abstract Algebra

Computer Oriented Numerical Methods

Data Structures

Data Based Management Systems

Operating Systems

Semester III

Topology

Computer Based Optimization Techniques

Computer Networks

Mechanics

Seminar

Semester IV

Functional Analysis

Dissertation

Computer Graphics

Interactive Devices: Graphics input devices, output devices display devices-random scan and raster scan displays.

Graphics Hardware: Video controller, graphics controller, raster scan display processor.

Scan Conversions: Scan converting lines, rectangles, circles, ellipses, arcs and sectors. DDA algorithm, Bresenham Algorithm, midpoint algorithms for line and circle.

Filling Polygons: Boundary fill, flood fill , scan line polygon fill algorithm

Transformations: 2D transformations, 3D transformations, Homogeneous coordinates and matrix representation of 2D transformations and 3D transformations: translation, scaling, rotation. Composition of 2D Transformations and 3D Transformations.

Viewing Transformations And Clipping: Window-to-Viewport transformation, clipping Lines-Cohen Sutherland, Liang–Barskey Algorithms, Clipping Polygons Sutherland Hodgeman Algorithm, Wieler-Atherton Algorithm.

Mathematics Of Projection: Perspective projection, parallel projection.

Geometric Forms and Models: Polygon surfaces, curved surfaces, parametric equations, Beizer curves, spline curves, Beizer surfaces, spline surfaces.

Visible Surface Determination: Algorithms for visible line determination, z-buffer algorithm, list priority algorithm, scan-line algorithm, visible ray tracing, painter’s algorithm, subdivision algorithm.

Illumination And Shading: Illumination models, shading models for polygons, shadows, transparency.

Laboratory Work: The lab work will be based on: Line generation using Bresenham’s line algorithm, Parallel line algorithm, Circle generation algorithm: midpoint circle algorithm, Ellipse generation algorithm: midpoint ellipse algorithm, Scan-line polygon fill algorithm, Transformation Techniques: translation, rotation, scaling, Composite transformation: translation, rotation, scaling, Line clipping: Cohen -Sutherhand line clipping, Sutherhand-Hodgeman polygon clipping.