FI:PA093 Computational Geometry Project - Course Information
PA093 Computational Geometry Project
Faculty of InformaticsAutumn 2017
- Extent and Intensity
- 0/1/1. 2 credit(s) (plus extra credits for completion). Type of Completion: z (credit).
- Teacher(s)
- doc. RNDr. Barbora Kozlíková, Ph.D. (lecturer)
- Guaranteed by
- doc. RNDr. Petr Matula, Ph.D.
Department of Visual Computing – Faculty of Informatics
Supplier department: Department of Visual Computing – Faculty of Informatics - Timetable
- Mon 18:00–19:50 B311
- Prerequisites
- It is recommended to concurrently attend or finish the M7130 course before attending this course. Moreover, student should have the knowledge of C++ or Java programming language.
- 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
- Applied Informatics (programme FI, N-AP)
- Computer Graphics and Image Processing (programme FI, B-IN)
- Computer Graphics (programme FI, N-IN)
- Image Processing (programme FI, N-AP)
- Course objectives
- 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.
- Learning outcomes
- 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
- Syllabus
- 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.
- Literature
- PREPARATA, Franco P. and Michael Ian SHAMOS. Computational geometry : an introduction. New York: Springer-Verlag, 1985, 398 s. ISBN 0387961313. info
- Teaching methods
- Lectures, consultations and related individual work.
- Assessment methods
- Completion of an individual project is required.
- Language of instruction
- Czech
- Further Comments
- Study Materials
The course is taught annually.
- Enrolment Statistics (Autumn 2017, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2017/PA093