Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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?
CGal does nearly what you want, and is GLP/QPL. Check out this page. It looks like you’ll have to do a bit of fiddling to use their lower library functions to make a 3D rectangular case if bounding spheres aren’t what you want, but for the purposes of speeding up collision detection, bounding spheres should be fine.