Can the K-d tree be enhanced with af find N nearest places ?
Can the K-d tree be enhanced with af find N nearest places ?