User Rating!

Home > Search > Articles & Samples > C-Sharp > Database > Data Structures

3D Interval KD-Tree    Version: 0.00       Price: $0.00

Total Hits: 48  |  Today: 0 Author: Tommi Laukkanen       Rating:

Read Reviews | Write Review | Your Rating:  Select One 5 Stars - Best Rating 4 Stars 3 Stars 2 Stars 1 Star - Worst Rating

A C# KD-Tree for storing 3D axis aligned bounding boxes easily. KD-Tree is an efficient method for finding bounding boxes in 3d space compared to iterating through all boxes and evaluating their intersection with the search volume. There are two files in the attached download. One which contains the implementation and another for Unit Test cases. You can directly copy these to your projects.

DevASP.Net users Rating What is your opinion? 5 Stars4 Stars3 Stars2 Stars1 Star

Is this your listing?

If this is your listing and you like to add the rating box
displayed on the right side on your site you can use the following code.