PB009 Principles of Computer Graphics

Faculty of Informatics
Spring 2008
Extent and Intensity
2/1. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
Teacher(s)
prof. Ing. Jiří Sochor, CSc. (lecturer)
RNDr. Filip Andres (seminar tutor)
RNDr. Petr Beneš, Ph.D. (seminar tutor)
doc. RNDr. Barbora Kozlíková, Ph.D. (seminar tutor)
Guaranteed by
prof. Ing. Jiří Sochor, CSc.
Department of Visual Computing – Faculty of Informatics
Contact Person: prof. Ing. Jiří Sochor, CSc.
Timetable
Wed 10:00–11:50 D3
  • Timetable of Seminar Groups:
PB009/01: each even Thursday 8:00–9:50 B311, P. Beneš
PB009/02: each odd Thursday 8:00–9:50 B311, P. Beneš
PB009/03: each even Thursday 10:00–11:50 B311, B. Kozlíková
PB009/04: each odd Thursday 10:00–11:50 B311, B. Kozlíková
PB009/05: each even Thursday 12:00–13:50 B311, B. Kozlíková
PB009/06: each odd Thursday 12:00–13:50 B311, B. Kozlíková
PB009/07: each even Thursday 14:00–15:50 B311, F. Andres
PB009/08: each odd Thursday 14:00–15:50 B311, F. Andres
Prerequisites
The knowledge of matrix calcul, linear algebra and geometry , programming in C.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 200 student(s).
Current registration and enrolment status: enrolled: 0/200, only registered: 0/200, only registered with preference (fields directly associated with the programme): 0/200
fields of study / plans the course is directly associated with
Course objectives
The course covers the fundamental computer graphics algorithms and the methods for modelling and rendering. Students would be able to orient themselves in the broad spectrum of computer graphics problems together with the necessary math foundations.
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Š, Jiří SOCHOR and Petr FELKEL. Moderní počítačová grafika (Moder Conmputer Graphics). 2nd ed. Praha: Computer Press, 2005, 609 pp. I 1. ISBN 80-251-0454-0. info
  • FOLEY, James D. Computer graphics :principles and practice. 2nd ed. Reading: Addison-Wesley Publishing Company, 1990, 1174 s. ISBN 0-201-12110-7. info
Assessment methods (in Czech)
2 domácí úlohy jsou nezbytné pro udělení zápočtu a jsou podmínkou pro písemnou zkoušku. Předmět je hodnocen na základě písemné zkoušky. 2 homework assignments completed before final examination. Evaluation is based on written exam.
Language of instruction
Czech
Further comments (probably available only in Czech)
The course is taught annually.
Listed among pre-requisites of other courses
Teacher's information
http://www.fi.muni.cz/~sochor/PB009
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2009, Spring 2010, Spring 2011, Spring 2012, Spring 2013, Spring 2014, Spring 2015, Spring 2016, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024, Spring 2025.
  • Enrolment Statistics (Spring 2008, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2008/PB009