|
Lecturer(s)
|
|
|
|
Course content
|
1. Drawing 2D elements; Bresenham algorithm 2. Area filling (scan-line fill algorithm, seed fill algorithm); clipping 3. Image editing; color space reduction, histogram 4. Noise reduction, sharpening, edge detection 5. Coordinate systems; geometric transformation, projections methods 6. Boundary, volumetric and procedural representation, solid modeling 7. Light and local illumination models 8. Shading methods (flat, Gouraud, Phong) 9. Problem of visibility, shadows (projection methods, shadow volume, depth buffering) 10. Textures 11. Radiance, rendering equation, radiosity 12. Global illumination models; ray tracing, photon maps
|
|
Learning activities and teaching methods
|
|
unspecified
|
|
Learning outcomes
|
The course is devoted to the theory and algorithms of 2D and 3D computer graphics. The students are introduced to the following topics: drawing 2D elements, image processing, modeling the 3D objects and rendering the scene. Exercises are used to validate the discussed algorithms in the programming.
|
|
Prerequisites
|
oral exam, credit requirements: own program according to the teacher's instructions
KI/MPG
|
|
Assessment methods and criteria
|
unspecified
|
|
Recommended literature
|
-
Beneš,B.,Felkel,P.,Sochor,J.,Žára,J. Vizualizace, Praha, ČVUT. 1997.
-
Hashimoto A. Velká kniha digitální grafiky a designu. Computer Press, Brno, 2008.
-
Sochor,J., Žára,J., Beneš,B. Algoritmy počítačové grafiky, Praha, ČVUT. 1996.
-
Žára J., Beneš B., Felkel P. Moderní počítačová grafika, 2. vydání. null. Computer Press, Brno, 2005. ISBN null.
|