Hi,
I would like to get any suggestion for any paper/reference that discussed about the KDTree with the fixed-radius algorithm.
I found numerous references but most of them are the extended / improvement of the KDtree with fiixed radius. My focus is on the fundamental concept.
I found this book discussed about the KDTree but it does not include the fixed radius in NN searching.
http://people.inf.elte.hu/fekete/algoritmusok_msc/terinfo_geom/konyvek/Computational%20Geometry%20-%20Algorithms%20and%20Applications,%203rd%20Ed.pdf
Appreciate if anyone can help me
Dear Aparna Sathya Murthy,
Thanks you very much for your suggestion.
Since you are experienced with NNs, can i ask you about the KDTree with a fixed-radius in this video.
https://www.youtube.com/watch?v=Y4ZgLlDfKDg
In the minutes of 4.57 , its purpose is to find the new point (7,4). When a circle is created, by right, there are few points in the circle.Due to only two points (9,6) and (7,2) are within the circle and the rectangle space, they are considered as the nearest neighbor points of the (7.4). Is that (5,4) considered excluded from the nearest neighbor of (7,4) due to its located out of the rectangle boundary?
- Badges
- Science topic