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.

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

Inverse postal code geocoding #7

Open
rth opened this issue Apr 7, 2019 · 1 comment
Open

Inverse postal code geocoding #7

rth opened this issue Apr 7, 2019 · 1 comment

Comments

@rth
Copy link
Member

rth commented Apr 7, 2019

It should be fairly straightforward to implement inverse geo-coding, i.e. find the closest city/region/country for given coordinates.

This would require downloading all the datasets however.

Ideally, the nearest neighbor lookup could be done efficiently with a KD-tree structure (e.g. in scipy). Though scipy is a fairly heavy dependency so maybe this could be an optional feature if scipy is installed.

@rth rth added the new feature label Apr 7, 2019
@rth
Copy link
Member Author

rth commented Apr 7, 2019

Ideally, the nearest neighbor lookup could be done efficiently with a KD-tree structure

Actually, computing brute force nearest neighbor search could be a start: memory and performance optimizations with KDTree could be added later.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant