An O(n log n) Algorithm for the All-Nearest-Neighbors Problem. P.M. Vaidya — 1989 Discrete & computational geometry
A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions. P.M. Vaidya — 1991 Discrete & computational geometry