P009 Principles of Computer Graphics

Faculty of Informatics
Spring 2001
Extent and Intensity
2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. Ing. Jiří Sochor, CSc. (lecturer)
RNDr. Jan Flasar, Ph.D. (seminar tutor)
Mgr. Zdeněk Kabeláč (seminar tutor)
RNDr. Lubomír Markovič (seminar tutor)
doc. RNDr. Radek Ošlejšek, Ph.D. (seminar tutor)
Mgr. Petr Tobola, Ph.D. (seminar tutor)
Guaranteed by
doc. Ing. Jan Staudek, CSc.
Department of Computer Systems and Communications – Faculty of Informatics
Contact Person: prof. Ing. Jiří Sochor, CSc.
Timetable
Tue 12:00–13:50 D1
  • Timetable of Seminar Groups:
P009/01: each odd Wednesday 12:00–13:50 B116, J. Sochor, P. Tobola
P009/02: each even Wednesday 12:00–13:50 B116, J. Sochor, P. Tobola
P009/03: each odd Wednesday 12:00–13:50 B117, R. Ošlejšek, J. Sochor
P009/04: each even Wednesday 12:00–13:50 B117, R. Ošlejšek, J. Sochor
P009/05: each odd Wednesday 14:00–15:50 B116, J. Sochor, P. Tobola
P009/06: each even Wednesday 14:00–15:50 B116, J. Sochor, P. Tobola
P009/07: each odd Wednesday 14:00–15:50 B117, L. Markovič, J. Sochor
P009/08: each even Wednesday 14:00–15:50 B117, L. Markovič, J. Sochor
P009/09: each odd Wednesday 16:00–17:50 B116, Z. Kabeláč, J. Sochor
P009/10: each even Wednesday 16:00–17:50 B116, Z. Kabeláč, J. Sochor
P009/11: each odd Wednesday 16:00–17:50 B117, J. Flasar, J. Sochor
P009/12: each even Wednesday 16:00–17:50 B117, J. Flasar, J. Sochor
P009/13: each odd Wednesday 18:00–19:50 B116, Z. Kabeláč, J. Sochor
P009/14: each even Wednesday 18:00–19:50 B116, Z. Kabeláč, J. Sochor
P009/15: each odd Wednesday 18:00–19:50 B117, J. Flasar, J. Sochor
P009/16: each even Wednesday 18:00–19:50 B117, J. Flasar, J. Sochor
Prerequisites
Knowledge of linear algebra and geometry covered e.g. in M503 Linear Algebra and Geometry I.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Graphic primitives drawing, raster algorithms.
  • Segment and polygon clipping. Line fill, seed fill.
  • Aproximation and interpolation curves, surfaces. Hermite interpolation, Bézier, NURBS.
  • Color, color perception, color models.
  • Raster image processing: color reduction, convolution, transformation.
  • Solid modelling. Space enumeration, boundary models, CSG.
  • Parallel and perspective projection, unified projections. Normalised view volume.
  • Visibility in object space, visibility in image space.
  • Illumination models, smooth shading.
  • Shading techniques, sharp and soft shadows, light reflections. Global illumination models.
  • Ray tracing.
Literature
  • ŽÁRA, Jiří, Bedřich BENEŠ and Petr FELKEL. Moderní počítačová grafika. Vyd. 1. Praha: Computer Press, 1998, xvi, 448. ISBN 8072260499. info
  • SOCHOR, Jiří, Jiří ŽÁRA and Bedřich BENEŠ. Algoritmy počítačové grafiky. 2. přeprac. vyd. Praha: ČVUT, 1996, 184 s. ISBN 8001014061. info
Assessment methods (in Czech)
2 domácí úlohy jsou nezbytné pro udělení zápočtu a jsou podmínkou pro kolokvium a písemnou zkoušku. Předmět je hodnocen na základě písemné zkoušky, otázky pro kolokvium jsou podmnožinou otázek pro zkoušku.
Language of instruction
Czech
Further comments (probably available only in Czech)
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/usr/sochor/P009
The course is also listed under the following terms Autumn 1995, Autumn 1996, Autumn 1997, Autumn 1998, Spring 2000, Spring 2002.
  • Enrolment Statistics (Spring 2001, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2001/P009