Image talk:KDTree-animation.gif

From Wikipedia, the free encyclopedia

Perhaps a more complex example is in order, basically how to backtrack after you have located the nearest, here is an example, ambiet unfinished, but it gives you the idea (I didn't plan out the nodes very well and realized that you would have to search the entire tree in it, after that threw it away). Chase-san (talk) 10:28, 25 January 2008 (UTC)

'Ello! Cheers for taking the time to upload a good alternative. I think we can make our images clearer if we show a stack that contains the bounding region, the parent nodes and the state of the nodes leading in (in my implementation i simply use an integer to track the nodes status, either an unvisited node, a first backtrack or a second backtrack, pushing this on the stack as needed). Clearly illustrating this point is harder than it seems :) User A1 (talk) 09:57, 24 January 2008 (UTC)

I only recently figured it out myself, I realized that the backstep would most definitely involve a recursive search. My example is poor as I threw it togeather quickly with photoshop, it would of been better if I had programmed it by hand in svg/xml. Chase-san (talk) 10:28, 25 January 2008 (UTC)