Re: [Algorithms] Bounding Box calculation

[Mustapha B. <ja...@gm...>]

Hi,

A "long time ago" (2000, not that far hopefully), I implemented it using the
covariance matrix (Sorry, the work was explained in french only -
http://mustapha.bismi.free.fr/articles/obb.pdf ).

The paper I used as a reference was "OBB-Tree: A Hierarchical Structure for
Rapid Interference Detection" (http://citeseer.ist.psu.edu/108215.html). The
whole "hierarchical OBB tree" thing is maybe over the top, but the algorithm
to compute the OBBs is detailed there.

Hope this helps ^_^

Cheers,

- Mustapha Bismi
- http://antipatterns.hautetfort.com

On 10/29/07, Stephen Clibbery <ste...@la...> wrote:
>
>
> Hi,
>
> I need to calculate an oriented bounding box form a point cloud. I have
> previously used a rather brute-force rotating-caliper style approach,
> which
> gave good results but was slow. I need something faster now; I guess the
> covariance matrix method is the way to go..? Does anyone bother taking the
> convex hull of the points first, or does this not make much difference in
> practice?
>
> Cheers,
> Steve.
>
> Stephen Clibbery
> Technology Director
> Lateral Visions Software Company
>
>
>
>
> -------------------------------------------------------------------------
> This SF.net email is sponsored by: Splunk Inc.
> Still grepping through log files to find problems?  Stop.
> Now Search log events and configuration files using AJAX and a browser.
> Download your FREE copy of Splunk now >> http://get.splunk.com/
> _______________________________________________
> GDAlgorithms-list mailing list
> GDA...@li...
> https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
> Archives:
> http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list
>