Neighbour searching in high-dimensional spaces

Many applications exist for interrogating large, scattered, high-dimensional data sets to find a group of nearby points for an arbitrary test point. Examples range from advanced methods to simulate chemical reactions to facial recognition software. This project will develop fast neighbour searching algorithms and implementations with a focus on applications in chemistry and physics.

Suitable candidates will have a mathematical background suitable for applied mathematics research, and engage in scientific programming.