Last update: RNDr. Michal Kopecký, Ph.D. (18.06.2019)
Computer Graphics. Device and logical coordinate systems. Geometric transformations in two and three dimensions.
Algorithms for basic 2-D drawing primitives, such as Brensenham's algorithm for lines and circles, Bezier and B-Spline functions for curves, and line and polygon clipping algorithms.
Perspectives in 3-D, and hidden-line and hidden-face elimination, such as Painter's and Z-Buffer algorithms. Fractals and the Mandelbrot set.
Last update: RNDr. Michal Kopecký, Ph.D. (18.06.2019)
Computer Graphics. Device and logical coordinate systems. Geometric transformations in two and three dimensions.
Algorithms for basic 2-D drawing primitives, such as Brensenham's algorithm for lines and circles, Bezier and B-Spline functions for curves, and line and polygon clipping algorithms.
Perspectives in 3-D, and hidden-line and hidden-face elimination, such as Painter's and Z-Buffer algorithms. Fractals and the Mandelbrot set.
Course completion requirements -
Last update: Kang Zhang (01.10.2019)
Grades will be determined by a project and a final essay (with presentation). Their weightings are as follows:
Project: 40%
Presentation: 20%
Final essay: 40%
To pass the course, a student must perform satisfactorily in all the assessments.
Last update: Kang Zhang (01.10.2019)
Grades will be determined by a project and a final essay (with presentation). Their weightings are as follows:
Project: 40%
Presentation: 20%
Final essay: 40%
To pass the course, a student must perform satisfactorily in all the assessments.
Literature -
Last update: RNDr. Michal Kopecký, Ph.D. (18.06.2019)
L. Ammeraal and K. Zhang, Computer Graphics for Java Programmers, 3rd Edition, Springer, 2017.
Last update: Kang Zhang (01.10.2019)
L. Ammeraal and K. Zhang, Computer Graphics for Java Programmers, 3rd Edition, Springer, 2017.
