[Spatial] Nearest point in a specific region

[Henrique T. <ht...@te...>]

Hi Silvain,

I am currently working on a project where I need to search for for a
nearest point given a location in a 3d space. Your lib has come in handy
very well (congrats!)

Now I am trying to evolve into a more specific goal, that would be finding
the nearest point in a predefined 3d region. This predefined region would
not necessary be regular nor orthogonal, in fact, it would be similar to a
pyramid.

Given my knowledge of the kd-tree structure, I have an idea of how I could
verify at each step through the tree levels if the generated hyper-plane
excludes or includes such volume (that would be MY problem), however I am
currently experiencing some trouble in how to insert such traverse
intelligence in the existing code.

Would you have any suggestion of how to best define a custom
tree-traversing operation in your kd-tree structure?

Thanks in advance!
Henrique