• Advertisement
Sign in to follow this  

Using Kd-trees for orthogonal parallelepipeds

This topic is 3474 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hello, I have a huge number of orthogonal parallelepipeds. Given one such orthogonal parallelepiped 'A' I would like to know which orthogonal parallelepipeds 'B[]' the centroid of A intersects. Of course I need to be able to insert/delete. I am trying to solve this by using kd-trees. However, I am usually finding implementations for points instead. Does anyone have any experience with any implementations such as: http://www.cs.sunysb.edu/~algorith/implement/KDTREE/implement.shtml for example if they support parallelepipeds instead of points. Any other ideas? Thanks alot, [Edited by - dimitris on August 19, 2008 4:13:16 AM]

Share this post


Link to post
Share on other sites
Advertisement
Sign in to follow this  

  • Advertisement