# 186.122 Algorithmic Geometry This course is in all assigned curricula part of the STEOP.\$(function(){PrimeFaces.cw("Tooltip","widget_j_id_21",{id:"j_id_21",showEffect:"fade",hideEffect:"fade",target:"isAllSteop"});});This course is in at least 1 assigned curriculum part of the STEOP.\$(function(){PrimeFaces.cw("Tooltip","widget_j_id_23",{id:"j_id_23",showEffect:"fade",hideEffect:"fade",target:"isAnySteop"});}); 2021W 2020W 2019W 2018W 2017W 2016W 2015W 2014W 2013W 2012W 2010W 2009W 2008W 2007W 2006W 2005W 2004W 2003W 2002W

2021W, VU, 2.0h, 3.0EC

## Properties

• Semester hours: 2.0
• Credits: 3.0
• Type: VU Lecture and Exercise
• Format: Online

## Learning outcomes

After successful completion of the course, students are able to

• explain fundamental concepts, structures and problem definitions in algorithmic geometry
• explain, assess, and analyze the discussed algorithms
• select and adapt appropriate algorithms and data structures to related problems
• model and analyze unknown applied or theoretical geometric problems and develop and possibly implement efficient solutions independently

# If you are looking for the Algorithmic Geometry course in the winter term 2022, please go to VU 192.133!

Spatial data are processed in various subfields of computer science, e.g. in computer graphics, visualization, geographic information systems, robotics etc. The area of computational geometry deals with the design and analysis of geometric algorithms and data structures. In this module we present common techniques and concepts in computational geometry in the context of selected and applied geometric questions. The following topics are covered in the course:

• convex hulls
• line segment intersections
• polygon triangulation
• range queries
• point location
• Voronoi diagrams and Delaunay triangulations
• duality of points and lines
• well-separated pair decomposition
• visibility graphs

## Teaching methods

• Definition, design and analysis of algorithms and data structures, discussion and formal proofs of algorithmic and geometric properties, examples
• Joint and independent solving of exercise and example tasks
• Discussion of exercise tasks and proof ideas in (virtual) exercise groups
• Lecture content will be provided weekly as recorded videos; live discussions will help consolidating the material.

## Mode of examination

Immanent

### Distance Learning

This course takes place in hybrid "distance learning" mode. There will be four blocks of lectures, for which learning videos and material are provided that can be watched asynchronously. The exercise part consists of one exercise sheet per block to be solved and handed in. The discussion of the exercises takes place in a hybrid live exercise session (physically in a seminar room and streamed via Zoom). Further we will offer an electronic live meeting for each block to discuss and deepen the course material (Wednesdays from 14:00-16:00). Finally, we use quizzes and discussion forums in TUWEL.

The first lecture takes place live on October 5, 2021 from 9:00-11:00 in Zoom. The Zoom URL will be announced to all registered students before the first lecture.

### ECTS-Breakdown

25 h attending lectures and exercises
30 h lecture follow-up and preparation of home exercises
19.5 h preparation for oral exam
0.5 h oral exam
------
75 h overall

Please send mails concerning general and organisational issues to alggeom@ac.tuwien.ac.at.

## Examination modalities

• Solve and hand-in exercise sheets with theoretical questions
• Implementation of algorithms (optional)
• Present and discuss the course content in an oral exam

The oral exam counts for 70% of the grade, the exercise coursework for 30%.

## Course registration

Begin End Deregistration end
02.09.2021 00:00 08.10.2021 00:00 19.10.2021 00:00

## Group Registration

GroupRegistration FromTo
Group 105.10.2021 08:0013.10.2021 23:59

## Curricula

Study CodeObligationSemesterPrecon.Info
066 504 Master programme Embedded Systems Not specified
066 645 Data Science Not specified
066 926 Business Informatics Mandatory elective
066 931 Logic and Computation Mandatory elective
066 932 Visual Computing Mandatory elective
066 937 Software Engineering & Internet Computing Mandatory elective
066 938 Computer Engineering Mandatory elective
066 950 Didactic for Informatics Mandatory elective

## Literature

Recommended literature:

M. de Berg, O. Cheong, M. van Kreveld, M. Overmars:
Computational Geometry Algorithms and Applications, Springer 2008.

D. Mount:
CMSC 754 Computational Geometry Lecture Notes, U. Maryland 2014.

## Previous knowledge

A solid knowledge of the design and analysis of algorithms is recommended.

Lecture slides and videos will be made available to the students.

English