[Closed] Nearest vertex near point

Right, I got it. Thanks for the reference! By building the kd tree we will be able to eliminate a large amount of the search space – and hence the comp. complexity – if we are going to ask for the nearest neighbor repeatedly.

You could potentially start by looking at which elements are closest to the point, then by face and that may reduce the amount of vertices you actually need to test, but may be slower, it would entirely depend on the type of object,

I would have thought for most cases though the brute force approach wouldn’t be too slow.

(Wow I’m apparently famous!)

http://forums.cgsociety.org/showpost.php?p=6983924&postcount=21