Offtopic, but some of you might be interested.
I just finished implementing the algorithm presented in Real-time rendering to calculate a tight fitting bounding box.
It uses quickhull to create the convex hull and then compute the covariance matrix and it’s eigenvectors to then find the OBB.
I tested it with all sorts of models and it looks pretty robust. If one of you ever use it and make it crash or throw, just send me the points you used.
You can pick it up here.
I believe it is documented well enough(at least the convex hull part!). I know it compiles under gcc3.1, gcc3.0.4, and Borland 5.
MSVC++ users should only need to fix for-loop index variable repetitions.
Well, I hope it will be of use to someone.
I forgot to mention, the point list can contain duplicated points. So that way you just need to dump your vertices in a vector.
[This message has been edited by Gorg (edited 06-02-2002).]