|
|
|
|
|
by thegeekyasian
1226 days ago
|
|
I've created a project that provides in-memory Geo-spatial Indexing, with 2-dimensional K-D Tree. I've worked on multiple projects where I used K-D Trees to find the nearest neighbors for provided geo coordinates with efficient results. I used this implementation for applications with ~35m requests per day, with custom modifications and it worked like a charm. Hence I have created a generic implementation, ready to use. I have already shared great feedback from many programmers and working on improvements already to add new features. The project is open to suggestions and contributions as well. Feel free to create any issues on the GitHub repository. |
|
But why design Point so that you have to do:
`Point point = new Point.Builder() .latitude(25.2012544) .longitude(55.2569389) .build();`
Instead of:
`Point point = new Point(25.2012544,55.2569389)`
Cool project btw... working with geospatial data can be fun.