Given N points I need to find Closest point among all the given points to all the given points in plane in less than O(n^2).↵
↵
The distance used is Euclidean distance.↵
↵
I came to know that for any metric distance we can use kd-Tree to solve such problems. (I may be wrong) ↵
↵
I also came to know that for chebychev distance the problem can be solved using orthogonal range querying and manhattan distance problem can also be converted into chebychev distance problem.↵
↵
Is there any way to solve Euclidean distance problem more easily with some other trick?↵
↵
The distance used is Euclidean distance.↵
↵
I came to know that for any metric distance we can use kd-Tree to solve such problems. (I may be wrong) ↵
↵
I also came to know that for chebychev distance the problem can be solved using orthogonal range querying and manhattan distance problem can also be converted into chebychev distance problem.↵
↵
Is there any way to solve Euclidean distance problem more easily with some other trick?↵
