NN searches in (indexed) Point sets are a tool i need all the time in Rhino. And over the years i found different ways to handle the problem.
E.g. as far as i can tell several mesh methods have acceleration structures build in, so it can be faster to build a semi-invalid mesh from a polyline to do closest point calculations on it. That was used for a isomesher that builds ‘blobmeshes’ around splines, where the fake mesh was magnitudes faster than native polyline NN methods.
External libraries are another - ‘Alglib’ works nicely, but you need the dll around, so its quite bad for distribution. (working with students, and also only c#-GH scripting components)
Now there is RTree, and i would use it, but why the callback? I am not an expert, but doesn’t that mean it runs async? I need a NN search in my loop that works now, and not maybe calls back in 20ms…
So my point / question is - am i missing something, and what is the best way to approach this? And can i use RTree without those callbacks?
I hope what i wrote makes sense and is not totally besides the point.
Thanks for reading!