24.01.2012

On Friday 27 April Peyman Afshani will give a Computer Science Friday Lecture on:

Let's Talk about Computational Geometry (CG)

Abstract: In this talk, I will introduce my research area, discrete and computational geometry. There are many different waysto motivate the study of computational geometry problems. Some researchers study them because they show up in diverse areas and have broad applications. Other researchers, including me, are fascinated by the beauty and the elegant structure of these problems. The research area that studies this structure is known as discrete geometry and studying it is a vital part of research in computational geometry.

I will review some of the fundamental concepts and problems in discrete and computational geometry. I will mention some of the big challenges that is faced by researchers in this area and I will discuss the importance of discrete geometry and show how it helps us build better algorithms and data structures.

Towards the end, I will focus on my own research, particularly on geometric data structures. I will show that many classical areas of computational geometry that were once considered "solved" are in fact full of very deep and important open problems and I will discuss my attempts in settling some of the open problems. I will end the talk with some open problems and challenges that still need to be addressed.

About Peyman Afshani: www.cs.au.dk/~peyman/

Coffee and cake at 14:00 - the talk begins at 14:15