Where can I find a c/c++ implementation of the minimum bound box algorithm?

Question

I'm looking for a free implementation that finds the minimum bounding box (MBB - the box around a cloud of 3D points with the smallest volume). It should be written in either C or C++.

An algorithm to do this was published by Joseph O'Rourke and is cubic in time. I'd also be content with an approximate MBB genered for instance by the algorithms proposed by Gill Barequet, and Sariel Har-Peled. Can anyone point me to an implementation that is free software?

Answer 1

See http://valis.cs.uiuc.edu/~sariel/research/papers/00/diameter/diam_prog.html which has full code of the Barequet and Har-Peled algorithms.