Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Euclidean distance used with geodetic coordinates to find nearest neighbours in K-D tree #8

Closed
thampiman opened this issue Mar 30, 2015 · 0 comments
Closed

Euclidean distance used with geodetic coordinates to find nearest neighbours in K-D tree #8

thampiman opened this issue Mar 30, 2015 · 0 comments
Assignees
@thampiman

Comments

@thampiman
Copy link
Owner

The geodetic coordinates (lat,lon,alt) are used in the K-D tree and the nearest neighbour is found using the Euclidean distance function. See https://news.ycombinator.com/item?id=9281998 on why this is a bad idea for nearest neighbour search.
@thampiman thampiman self-assigned this Mar 30, 2015
thampiman added a commit that referenced this issue Mar 30, 2015
@thampiman
v1.2 released! This closes #2, #7 and #8.
2cf0b19
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@thampiman thampiman

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@thampiman