Computer Graphics Algorithms

Semestr: Summer

Range: 2+2s

Completion:

Credits: 4

Programme type: Undefined

Study form:

Course language:

Summary:

Raster and vector graphics, rasterization of graphics primitives, antialiasing, coordinate systems, transformations, curves, hatching and filling areas, clipping, color spaces and color models, dithering and palettes, raster and vector image formats, image compression, image processing, basic rendering techniques.

Keywords:

Course syllabus:

1. Basic rendering techniques
2. Raster and vector graphics, rasterization of graphics primitives
3. Coordinate systems, transformations
4. Circles, ellipses and arcs
5. Curves
6. Hatching and filling areas
7. Clipping
8. Color spaces and color models
9. Dithering and palettes
10. Raster and vector image formats, image compression
11. Basic algorithms of image processing
12. Raster image transformations, morphing, warping
13. Introduction to 3D graphics
14. Shading models

Seminar syllabus:

1. Information about terminal projects, establishing of working teams
2. 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. Terminal 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: