SluitenHelpPrint
Switch to English
Cursus: INFOGA
INFOGA
Geometrische algoritmen
Cursus informatieRooster
CursuscodeINFOGA
Studiepunten (ECTS)7,5
Categorie / NiveauM (Master)
CursustypeCursorisch onderwijs
VoertaalEngels
Aangeboden doorFaculteit Betawetenschappen; Graduate School of Natural Sciences;
Contactpersoondr. F Staals
E-mailF.Staals@uu.nl
Docenten
Docent
dr. F Staals
Overige cursussen docent
Contactpersoon van de cursus
dr. F Staals
Overige cursussen docent
Blok
2  (15-11-2021 t/m 04-02-2022)
Aanvangsblok
2
TimeslotD: D (WO-middag, WO-namiddag, Vrijdag)
Onderwijsvorm
Voltijd
Cursusinschrijving geopendvanaf 20-09-2021 t/m 03-10-2021
AanmeldingsprocedureOsiris
Inschrijven via OSIRISJa
Inschrijven voor bijvakkersJa
VoorinschrijvingNee
Na-inschrijvingJa
Na-inschrijving geopendvanaf 25-10-2021 t/m 26-10-2021
WachtlijstJa
Plaatsingsprocedureadministratie onderwijsinstituut
Cursusdoelen

Assessment
Homework exams that will be distributed thrice (5%, 25% and 25%), and in the exam week there will be a final exam (45%).
Each item has to be scored with at least a 5 to pass the course, and the weighted average, rounded, must be at least a 6. In addition, there will be a bonus assignment worth 0.5pts. The maximum achievable grade is a 10. The final exam is "closed book".
If you do not make or fail (<=4) two or more of the homework exams, you fail the course. If you fail one homework exam, you get a new, third homework exam based on later chapters of the book to replace the failed homework.
The repair test requires at least a 4 for the original test.

Inhoud

In many areas of computer science -- robotics, computer graphics and virtual reality, and geographic information systems are some examples -- it is necessary to store, analyze, and create or manipulate spatial data. This course deals with the algorithmic aspects of these tasks: we study the design and analysis of geometric algorithms and data structures.

Computer graphics, robot motion planning, computer games, simulations, geographic information systems, and CAD/CAM systems all make use of geometric algorithms to perform various tasks.
This course on geometric algorithms takes a fundamental viewpoint and discusses the design and analysis of geometric algorithms. We will study various algorithmic techniques and geometric concepts that are useful to solve geometric problems efficiently. These include plane sweep, randomized incremental construction, and multi-level data structures; geometric concepts include Voronoi diagrams and Delaunay triangulations, arrangements, and duality. We will apply these techniques to solve a variety of problems: convex-hull computation, line-segment intersection, polygon triangulation, low-dimensional linear programming, range searching, and point location are some examples. Each problem we study is motivated by a practical problem from one of the application areas.

Course form
Two lectures per week.

Literature
M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars.
Computational Geometry: Algorithms and Applications (3rd edition). Springer-Verlag, Heidelberg, 2008. ISBN 978-3-540-77973-5.

Competenties
-
Ingangseisen
-
Verplicht materiaal
-
Werkvormen
Hoorcollege

Toetsen
Eindresultaat
Weging100
Minimum cijfer-

SluitenHelpPrint
Switch to English