0
$\begingroup$

I have implemented a KD-Tree that stores coordinates (latitude, longitude). I have also implemented a Nearest Neighbor search algorithm using the Haversine distance. My question is, will I get correct results (same nearest neighbor) if I use euclidean distance instead ?

If not, can you give me a concrete example of 3 GPS coordinates (WGS84) where euclidean distance fails to distinguish which coordinate is closer to which ?

$\endgroup$
2
  • $\begingroup$ no, you will not. $\endgroup$
    – Sasha
    May 18, 2016 at 23:28
  • $\begingroup$ @Sasha Can you give me a concrete example of 3 GPS coordinates (WGS84) where euclidean distance fails to distinguish which coordinate is closer to which ? Because I am convinced that this is not possible. $\endgroup$
    – dimitris93
    May 19, 2016 at 0:03

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.