I've been working on a geospatial application, and one of the use cases was find... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		jjevanoorschot on Feb 17, 2023 \| parent \| context \| favorite \| on: Geo-Assist – An in-memory spatial engine to store ... I've been working on a geospatial application, and one of the use cases was finding intersections between large sets of polygons. For some use cases you might not need a separate data store like this. I used an in-memory RTree in Golang [0]. It's super fast and efficient. [0] https://github.com/tidwall/rtree

asadawadia on Feb 17, 2023 [–]

is it possible to get only N closest points that match the distance predicate?

tidwall on Feb 17, 2023 | [–]

Yes. That library has a flexible kNN method built in. https://pkg.go.dev/github.com/tidwall/rtree#RTree.Nearby

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact