Example of Quad tree used for closest point search speed up?

All I can find is pattern making, does anyone have an example of how to use the data structure of a quad tree to find the closest point in a big set?

At the moment I'm doing an O(n^2) search and it is too slow.

Replies to This Discussion

Permalink Reply by David Rutten on July 31, 2012 at 3:50am

Hi Ben,

is this a C#/VB question? If so, can you move it into the C#/VB/Python forum?

David Rutten

david@mcneel.com

Poprad, Slovakia

Permalink Reply by Ben Doherty on March 14, 2013 at 6:47pm

Hi, sorry for the very delayed reply. it wasn't a c# question, it was actually about using the quad tree component to produce an input to a bit of python, but the question was about the output of the quad tree component.

I was trying to roll my own closest point script, and I thought that using your trees would be better than brute forcing it.... then I noticed that there is a closest point component anyway.

Inspired by your posts on closest point searches (very nice by the way) I thought that I'd respond to this. It'd be great if that tree structure was expressed in a usable way from the n tree components rather than just being a neat pattern making trick.

Ben

RSS