Fig. 11From: Efficient spatial data partitioning for distributed \(k\)NN joinsIllustration of the \(k\)NN lookup process (Assuming \(k\,=\,5\))Back to article page