<div class="gmail_quote">On Thu, Oct 27, 2011 at 11:00 AM, Jalal Miftah <span dir="ltr"><<a href="mailto:jalal.miftah@amadeus.com">jalal.miftah@amadeus.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<font size="2" face="sans-serif">Ah...</font>
<br>
<br><font size="2" face="sans-serif">Thanks for you reply,</font>
<br>
<br><font size="2" face="sans-serif">For now I was using a transform filter
to rotate my point cloud in all the directions, and recompute a new bounding
box.</font>
<br>
<br><font size="2" face="sans-serif">I still don't understand what vtkOBBTree
is doing. Is it a tree with a lot of different bounding boxes? </font>
<br><font size="2" face="sans-serif">And it can help me, do you know how
to get the minimum bounding box? </font>
<br>
<br><font size="2" face="sans-serif">Best regards,</font>
<br><div class="im">
<br><font size="2" face="sans-serif">Jalal</font>
<br></div></blockquote><div><br></div><div>The OBBTree is a hierarchical spatial data structure. You could use the root (highest) level of the tree as one of your bounding boxes, but I don't think that will really help you in your search for all of them. Here is more info:</div>
<a href="http://www.vtk.org/doc/nightly/html/classvtkOBBTree.html#details">http://www.vtk.org/doc/nightly/html/classvtkOBBTree.html#details</a><br clear="all"><br></div><div class="gmail_quote">Note also that if you are planning to discretely rotate the data and then recompute a box, it would probably be identical and much faster to compute the box as simply the bounds:</div>
<div class="gmail_quote"><a href="http://www.vtk.org/Wiki/VTK/Examples/Cxx/PolyData/DataBounds">http://www.vtk.org/Wiki/VTK/Examples/Cxx/PolyData/DataBounds</a></div><div class="gmail_quote"><br></div><div class="gmail_quote">
<div>David </div></div>