kNN searching Query point and a positive integer Maintain heap of current estimates and th distance Compute minimum and maximum distances to regions   If minimum , no point in answer set { prune   If maximum and region contains at most points, all points in answer set-insert into heap   Otherwise, not sure-recurse into the region