kdtree
kdtree copied to clipboard
kyroy
A k-d tree implementation in Go.
`FindLargest`, `FindSmallest` are used when removing a node from the k-d tree. These functions do not take into account the axis of the currently expanded node https://github.com/kyroy/kdtree/blob/70830f883f1d7bdae54d5032c6d4473349e0cfa4/kdtree.go#L357-L368 Given we are...
Hey! Thank you for a great KDTree implementation. However, I had to alter some code to ease support of KDTrees in my project, so I suggest this refactoring, which you...
I added a GetData() interface to all point types. Also made sure to add this interface in kdtree.go. This change allows to access Data property of the points returned by...
Please can you please make nearest neighbour and range search across optimal number of go-routines ?
Hey, I submitted [PR](https://github.com/kyroy/kdtree/pull/2) with code, which will ease process of using module in projects. Can you give it a thought ?
Title: Add QueryBallPoint Method for n-Dimensional Range Searching Description: What changes were made? Implemented QueryBallPoint method: This method allows querying all points within a specified radius from a given point...
