Tree of 3d bounding boxes

[Moritz Moeller]

Dear kd-tree huggers. :)

I used KD trees often in recent years but always with 3d points.
Now I need to work with 3d bounding boxes for the 1st time.

I'm a little bit lost on how to do that myself with something like 
libkdtree++.
Does anyone have any pointers or a simple example to share?
Could I e.g. just treat 3d bounding boxes as 6-dimensional points?

Basically, what I'm after is a tree of 3d bounding boxes, not points.

The tree should also be balanced so that splitting planes intersect as 
few such boxes as possible, i.e. a box should ideally always be enclosed 
by a single cell, not intersect multiple cells.

Is libkdtree++ even the right lib for this sort of problem?

Heaps sorry about asking such n00b questions. :|


Cheers,

Moritz