Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2020/2021

Computational Geometry

Login to KOS for course enrollment Display time-table
Code Completion Credits Range
XP39VPG ZK 4 2P+2S
Lecturer:
Petr Felkel (guarantor)
Tutor:
Petr Felkel (guarantor)
Supervisor:
Department of Computer Graphics and Interaction
Synopsis:

Principles of computational geometry (CG), data structures and paradigms, methods of geometric search, convex polygons and hulls, applications of convex hull, proximity problems, Voronoi diagrams, triangulation, efficient intersection algorithms, intersection of semispaces and polygonal regions, geometry of rectangles, dual mappings and spaces, convex hull in dual space, algorithms of computer graphics and CG.

Students who completed course 36VGE cannot enroll.

Requirements:

Knowledge of Fundamental sorting and searching algorithms. Linear algebra and fundamentals of computer graphics are advantageous. Programming in C++.

Syllabus of lectures:
Syllabus of tutorials:
Study Objective:

Analysis and design of effective algorithms for geometric objects.

Study materials:

[1. Berg, M. de, Cheong, O., Kreveld, M. van, Overmars, M.: Coputational Geometry. Algorithms and Applications, Springer-Verlag, Berlin, 3rd ed., 2008. ISBN: 978-3-540-77973-5

2. O' Rourke, Joseph: Computational Geometry in C, Cambridge University Press, 1.vydání, 1994 nebo 2.vydání, 2000

3. Preperata F.P.- M.I.Shamos: Computational Geometry An Introduction. Berlin, Springer-Verlag,1985.

Note:
Further information:
https://cw.fel.cvut.cz/wiki/courses/cg/start
Time-table for winter semester 2020/2021:
Time-table is not available yet
Time-table for summer semester 2020/2021:
Time-table is not available yet
The course is a part of the following study plans:
Data valid to 2020-09-23
For updated information see http://bilakniha.cvut.cz/en/predmet11847404.html