# Popis předmětu - BE4M39VG

Přehled studia | Přehled oborů | Všechny skupiny předmětů | Všechny předměty | Seznam rolí | Vysvětlivky               Návod
BE4M39VG Computational Geometry
Role:PO Rozsah výuky:2P+2S
Katedra:13139 Jazyk výuky:EN
Garanti:Felkel P. Zakončení:Z,ZK
Přednášející:Felkel P. Kreditů:6
Cvičící:Felkel P. Semestr:Z

Webová stránka:

https://cw.fel.cvut.cz/wiki/courses/cg/start

Anotace:

The goal of computational geometry is analysis and design of efficient algorithms for determining properties and relations of geometric entities. The lecture focuses on geometric search, point location, convex hull construction for sets of points in d-dimensional space, searching nearest neighbor points, computing intersection of polygonal areas, geometry of parallelograms. New directions in algorithmic design. Computational geometry is applied not only in geometric applications, but also in common database searching problems.

Výsledek studentské ankety předmětu je zde: AE4M39VG

Cíle studia:

The course is an informal continuation of fundamental data structures and algorithms courses. You will learn geometric algorithms and data structures allowing for effective computations, e.g., localization of area hit by a ray, computation of intersections and triangulation. You will train presentation and professional discussion skills on the seminars. All of it should not be missing in knowledge of educated progressive Master of Science.

Osnovy přednášek:

 1 Computational geometry (CG), typical applications, effective algorithm design techniques 2 Fundamentals of geometry, data structures for CG. 3 Geometric searching 4 Geometric searching 2 5 Planar convex hull 6 Convex hull in 3D 7 Proximity problems, Voronoi diagram. 8 Voronoi diagram applications. 9 2D a 3D triangulations 10 Intersections of line segments 11 Intersections of polygonal areas and halfspaces 12 Geometry of parallelopids. 13 Dual algorithms. 14 New directions in algorithmic design

Osnovy cvičení:

 1 Introduction to the form of the seminars, Selection of topics for assignment. 2 Individual preparation of the presentations 3 Presentations of the topic assigned, discussion. Evaluation of the presentation materials and evaluation of the speech by classmate students. Ideas for improvements. 4 Presentation of the topic assigned 5 Presentation of the topic assigned 6 Presentation of the topic assigned 7 Presentation of the topic assigned 8 Presentation of the topic assigned 9 Presentation of the topic assigned 10 Presentation of the topic assigned 11 Presentation of the topic assigned 12 Presentation of the topic assigned 13 Assessment 14 Spare

Literatura:

 1 Preperata F.P.- M.I.Shamos: Computational Geometry An Introduction. Berlin, Springer-Verlag,1985. 2 Edelsbrunner H.: Algorithms in Combinatorial Geometry. Berlin, Springer - Verlag, 1987. 3 de Berg, M.,van Kreveld, M., Overmars, M., Schvarzkopf, O.: Computational Geometry, Berlin, Springer, 1997. 4 O' Rourke, Joseph: Computational Geometry in C, Cambridge University Press, 1st ed, 1994 or 2nd ed, 2000

Knowledge of Fundamental sorting and searching algorithms. Linear algebra and fundamentals of computer graphics are advantageous

Poznámka:

Klíčová slova:

Computational geometry, Discrete geometry, Geometrical algorithms.

Předmět je zahrnut do těchto studijních plánů:

 Plán Obor Role Dop. semestr MEOI5_2018 Computer Vision and Image Processing PO 3 MEOI3_2018 Computer Graphics PO 3

 Stránka vytvořena 17.7.2024 15:51:02, semestry: Z/2023-4, L/2024-5, L/2023-4, Z/2024-5, připomínky k informační náplni zasílejte správci studijních plánů Návrh a realizace: I. Halaška (K336), J. Novák (K336)