Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour

Shizhe Zhao, Daniel D. Harabor, David Taniar

We are interested in the problem of finding $k$ nearest neighbours in the plane and in the presence of polygonal obstacles ($\text{OkNN}$). Widely used algorithms for OkNN are ba…