Nearest Neighbor Search

Our Goal

We are currently developing algorithms that can be used in dynamic environments for geometric problems. In dynamic environments, users can insert/delete data and add conditions such as obstacles in nearest neighbor search. Most of the research in geometric problems focused on static environments and the results are optimal or nearly optimal algorithms in various problems. Our project will extend these preexisting results to be implemented in dynamic environments.

Growing Disk Simulation

Download Here

The latest version of DNN is available in our GitHub.

Related Links

CGAL: The Computational Geometry Algorithms Library

ANN: A Library for Approximate Nearest Neighbor Searching