Computer Graphics Algorithms

Semestr: Winter

Range: 14+4c

Completion:

Credits: 4

Programme type: Undefined

Study form: Parttime

Course language:

Summary:

The course contains basic and most frequently used computer graphics algorithms. The following methods for the work with raster graphics (2D) and spatial scenes (3D) are presented: drawing of graphical primitives, filling, clipping, color spaces, dithering, image formats, basic image processing, modeling and rendering of three-dimensional objects and scenes, visibility solving, shading, texturing, ray-tracing, radiosity.

Keywords:

Course syllabus:

1. Raster and vector graphics, line drawing algorithms
2. Circles and arcs, filling and hatching
3. Line and polygon clipping
4. Color spaces and models
5. Dithering, palette
6. Raster images formats, compression methods
7. Basic image processing, median operators
8. Representation of spatial objects
9. Visibility solving, shading
10. Texturing, modeling of spatial scenes
11. Ray-tracing
12. Radiosity
13. Accelerated rendering techniques, space subdivision techniques, Monte Carlo methods
14. Graphics accelerators

Seminar syllabus:

1. Information about semestral projects, establishing of working teams
2. Detailed specification of terminal project
3. Tuition - literature
4. Tuition
5. Tuition - user interface
6. Tuition
7. Tuition - implementation
8. Tuition
9. Tuition - testing, measuring
10. Tuition
11. Final program presentation
12. Scientific presentation
13. Discussion on written report
14. Assessment

Literature:

1. Foley, J.D., van Dam, A., Feiner, S.K., Hughes, J.F. Computer Graphics - Principles and Practice. Addison-Wesley, New York, 1990.

Examiners:

Lecturers:

Instructors: