FI:PA093 Computational Geometry Project - Course Information

PA093 Computational Geometry Project

Extent and Intensity

0/1/1. 2 credit(s) (plus extra credits for completion). Type of Completion: z (credit).

Teacher(s)

Mgr. Petr Tobola, Ph.D. (lecturer)

Guaranteed by

prof. Ing. Jiří Sochor, CSc.
Department of Visual Computing – Faculty of Informatics
Contact Person: Mgr. Petr Tobola, Ph.D.

Timetable

Thu 16:00–17:50 B411

Prerequisites

The knowledge of C++ language is a precondition for pass the exam.

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)
• Information Technology Security (programme FI, N-IN)
• Bioinformatics (programme FI, N-AP)
• Information Systems (programme FI, N-IN)
• Informatics (eng.) (programme FI, D-IN4)
• Informatics (programme FI, D-IN4)
• Informatics (programme FI, M-IN)
• Informatics (programme FI, N-IN)
• Parallel and Distributed Systems (programme FI, N-IN)
• Computer Graphics (programme FI, N-IN)
• Computer Networks and Communication (programme FI, N-IN)
• Computer Systems and Technologies (eng.) (programme FI, D-IN4)
• Computer Systems and Technologies (programme FI, D-IN4)
• Computer Systems (programme FI, N-IN)
• Embedded Systems (eng.) (programme FI, N-IN)
• Embedded Systems (programme FI, N-IN)
• Service Science, Management and Engineering (eng.) (programme FI, N-AP)
• Service Science, Management and Engineering (programme FI, N-AP)
• Theoretical Informatics (programme FI, N-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
• Upper Secondary School Teacher Training in Informatics (programme FI, N-SS) (2)
• Artificial Intelligence and Natural Language Processing (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.

Syllabus

• The purpose of this seminar is to discuss, extend and elaborate the subject area presented in M7130 , especially with respect to practical applications. Some selected geometric algorithms will be implemented during the course. The Aim of the first applications is to demonstrate the pitfalls of programming of computational geometry algorithms. Then an essential and substantially more complicated advanced algorithm follows. Students gain practical experience with advanced computational geometry programs implementation. Moreover, they familiarize with techniques necessary to solve the inherent computational geometry problems.

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

An individual project is required.

Language of instruction

Czech

Further Comments

The course is taught annually.

• Enrolment Statistics (Autumn 2009, recent)
  
• Permalink: https://is.muni.cz/course/fi/autumn2009/PA093