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

 Home / 3D Theory & Graphics / Building an OBB tree 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.

April 26, 2005, 12:36 PM

Hi everybody !

I'am playing around with OBB trees. How to build an optimal tree ? I have already use Google before.

What I know :
- The classical approach. We compute the three major axes of a vertices soup. It gives the root of tree. Then this first box is subdivided with some heuristics. A top-down approach, all the tree must be built from scratch if we want to add a new box in the tree...

What I don't know :
- Somebody knows a down-top approach ? I'am dreaming about a trick to build a nearly-optimal tree step by step. With AVL-trees and a tricky order function between boxes, it's possible. Which function ?

This thread contains 1 message.
Hosting by Solid Eight Studios, maker of PhotoTangler Collage Maker.