Abstract:
Computational geometry is an important area of algorithms and data structures that deals with algorithmic problems that have underlying geometric properties. Often this is due to spacial nature of the input data but in many cases even abstract data can be modeled geometrically and subsequently solved using techniques from computational geometry.

In this talk, after a very brief introduction to computational geometry, we will focus on some of the very important data structure problems in the area. We will review the classical breakthroughs and then continue by looking at newer results, specially those motivated by modern changes in computer architecture and demands to deal with massive data.