The project is focused on solving the tasks from computational geometry area. The aim is programming and visualization of classical 2D and 3D algorithms. Students gain practical experience in implementation and integration of complex algorithms from the field of computer graphics.
Výstupy z učení
After passing this course, the student will be able to:
- compare computational geometry algorithms with respect to their complexity
- choose the most appropriate computational geometry algorithms for given problems, according to their complexity and input requirements
- implement computational geometry algorithms described by a pseudocode
The purpose of this seminar is to discuss, extend and elaborate
the subject area presented in M7130, especially with
respect to its practical applications. Some selected geometric algorithms will be implemented during the course. The aim of the first task is to demonstrate the problems regarding programming of computational geometry algorithms. Then an implementation of an essential and substantially more complicated advanced algorithm follows. Students gain practical experience with the implementation of advanced computational geometry applications.
PREPARATA, Franco P. a Michael Ian SHAMOS. Computational geometry : an introduction. New York: Springer-Verlag, 1985. 398 s. ISBN 0387961313. info
Lectures, consultations and related individual work.