Data Structures for Geometric Problems

The area primarily deals with designing efficient data structures for query-style problems on geometric data sets. This area can be seen as a sub-area of computational geometry. Sample problems include searching for skyline/maximal points, dominating point sets, and so on.

Faculty

1. Kishore Kothapalli (Head)
2. Kishore Kothapalli (Head)
3. Kannan Srinathan

Lecturers/Research Lecturers

1. Anandaswarup Das