BSP tree for choosing closest point (from a selection of randomly distributed points) from current point?
Posted on 2006-04-28
I have a large collection of randomly distributed points in 3D and I wish to repeatedly find the closest point to another arbitrary (moving) point. I am aware of BSP trees and but don't know how to go about impementing one in C++ and all the examples I find are for depth sorting polygons. Is a BSP tree the best way to approach this problem or is there another way of doing it? If a BSP Tree is a good solution can someone tell me how to implement one for this?
Thanks in advance,