Not logged in, Join Here! or Log In Below:  
 
News Articles Search    
 

 Home / 3D Theory & Graphics / Finding nearest points within radius with Octree Account Manager
 
Archive Notice: This thread is old and no longer active. It is here for reference purposes. This thread was created on an older version of the flipcode forums, before the site closed in 2005. Please keep that in mind as you view this thread, as many of the topics and opinions may be outdated.
 
takis

March 10, 2005, 08:03 AM

Hello,

I have a octree filled of 3d points.
I have a point and i want all the neighbours within a radius of that point?
How can i realise this on an efficient manner?

Greets Takis

 
Illco

March 10, 2005, 09:51 AM

Start at the top of the tree and check if the sphere around the query point is within it. Then, for each sub-node that (partially) contains the sphere branch into it. Keep track of all nodes that do contain (part of) the sphere and are not divisable. You should end op with a list of all undivisable tree nodes which contain some part of the sphere. Of these nodes, you cannot do better than check all points against the sphere.

 
This thread contains 2 messages.
 
 
Hosting by Solid Eight Studios, maker of PhotoTangler Collage Maker.