Before revision:  We obtain these improvements based on linear-size shallow cuttings , which are a standard technique to deal with the k nearest neighbor problem for point sites in the Euclidean metric.
After revision:  We obtain these improvements based on linear-size shallow cuttings , which are a standard technique to deal with the k nearest neighbors problem for point sites in the Euclidean metric.