Skip to Content

Computational Geometry

Computational datageometry is concerned with algorithms that can be stated in geometric terms, often in the two-dimensional Euclidean space. Many questions are focused on the computational complexity (asymptotic running time in relation to the size of the input) of geometric problems where the obvious solution is nowhere close to being optimal.

Computational geometry has numerous applications to communication networks, engineering and geographical information systems and more. We are also interested in the study of data structures that are used in computational geometry or that arise from geometric considerations.