Sign in to follow this  
dimitris

Using Kd-trees for orthogonal parallelepipeds

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

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this