Geometry: Combinatorics and Algorithm

Aus VISki
Wechseln zu: Navigation, Suche

Overview

Abstract

Geometric structures are useful in many areas, and there is a need to understand their structural properties, and to work with them algorithmically. The lecture addresses theoretical foundations concerning geometric structures. Central objects of interest are triangulations. We study combinatorial (Does a certain object exist?) and algorithmic questions (Can we find a certain object efficiently?)

Objective

The goal is to make students familiar with fundamental concepts, techniques and results in combinatorial and computational geometry, so as to enable them to model, analyze, and solve theoretical and practical problems in the area and in various application domains. In particular, we want to prepare students for conducting independent research, for instance, within the scope of a thesis project.

Summaries

Exam Solutions

  • no exam solutions here yet

Additional Material

Literature

  • no literature here yet