<div class="gmail_quote">On Thu, Oct 27, 2011 at 9:46 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">Hi,</font>
<br>
<br><font size="2" face="sans-serif">Thanks for you reply.</font>
<br><font size="2" face="sans-serif">Indeed I want a single bounding box
for all my point cloud, let me explain :</font>
<br><font size="2" face="sans-serif">I have a point cloud, and I have to
find, among all the bounding boxes, the correct one (it's not necessarily
oriented in the same direction of the axis). I know how to determine the
right one. </font>
<br><font size="2" face="sans-serif">Now I need to find a way to get all
the bounding boxes.</font>
<br><font size="2" face="sans-serif">For now I was rotating my point cloud
and computing a new bounding box each time, but it's not really perfect.</font>
<br><font size="2" face="sans-serif">I tried vtkOBBTree, but I have an eigenfunction
issue. (I have this inside my vtkPolyData :</font>
<br>
<br><font size="1" face="}">vtkPoly->SetPoints(points); // vtkPoints *
(xyz data)</font>
<br><font size="1" face="}">vtkPoly->SetVerts(conn); // vtkCellArray *
</font>
<br><font size="1" face="}">vtkPoly->GetPointData()->SetScalars(colors);
// vtkUnsignedCharArray * (rgb data)</font>
<br>
<br><font size="2" face="sans-serif"> )</font>
<br>
<br><font size="2" face="sans-serif">Do you need more explanations?</font>
<br></blockquote><div><br></div>Please keep the discussion on the mailing list.</div><div class="gmail_quote"><br></div><div class="gmail_quote">vtkOBBTree will generate a hierarchical tree of boxes, so I don't think that's what you're looking for. Are you are trying to determine the smallest possible bounding box of the points? I still don't understand what you mean by "all the boxes".<br clear="all">
<br>David</div>