This is an implementation of nearest m-neighbours finidng using a KD-Tree and a Bucketed KD-Tree.
-
Notifications
You must be signed in to change notification settings - Fork 1
HeshamMeneisi/NearestNeighbour
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This is a solution to the Nearest Neighbour problem using a K-D Tree that finds the nearest m points to a specific point in a set of points in O(lgn) time.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published