<font size=2 face="sans-serif">Hi,</font>
<br>
<br><font size=2 face="sans-serif">Given a point cloud, you have an infinity
of bounding boxes (if you translate/rotate the point cloud for example),
that what I mean for "all the boxes".</font>
<br><font size=2 face="sans-serif">I am not looking for the smallest possible,
but something in between (the distance between my point cloud and one surface
of the bounding box should be minimum). But yes basically I need to find
one box among all of them.</font>
<br>
<br><font size=2 face="sans-serif">Hope this is better.</font>
<br>
<br><font size=2 face="sans-serif">Thank you</font>
<br>
<br><font size=2 face="sans-serif">Jalal </font>
<br>
<br>
<br>
<br><font size=1 color=#5f5f5f face="sans-serif">From:
</font><font size=1 face="sans-serif">David Doria <daviddoria@gmail.com></font>
<br><font size=1 color=#5f5f5f face="sans-serif">To:
</font><font size=1 face="sans-serif">Jalal Miftah <jalal.miftah@amadeus.com>,
vtkusers@vtk.org</font>
<br><font size=1 color=#5f5f5f face="sans-serif">Date:
</font><font size=1 face="sans-serif">27/10/2011 14:49</font>
<br><font size=1 color=#5f5f5f face="sans-serif">Subject:
</font><font size=1 face="sans-serif">Re: [vtkusers]
Get all the bounding boxes</font>
<br>
<hr noshade>
<br>
<br>
<br><font size=3>On Thu, Oct 27, 2011 at 9:46 AM, Jalal Miftah <</font><a href=mailto:jalal.miftah@amadeus.com><font size=3 color=blue><u>jalal.miftah@amadeus.com</u></font></a><font size=3>>
wrote:</font>
<br><font size=2 face="sans-serif">Hi,</font><font size=3> <br>
</font><font size=2 face="sans-serif"><br>
Thanks for you reply.</font><font size=3> </font><font size=2 face="sans-serif"><br>
Indeed I want a single bounding box for all my point cloud, let me explain
:</font><font size=3> </font><font size=2 face="sans-serif"><br>
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. <br>
Now I need to find a way to get all the bounding boxes.</font><font size=3>
</font><font size=2 face="sans-serif"><br>
For now I was rotating my point cloud and computing a new bounding box
each time, but it's not really perfect.</font><font size=3> </font><font size=2 face="sans-serif"><br>
I tried vtkOBBTree, but I have an eigenfunction issue. (I have this inside
my vtkPolyData :</font><font size=3> <br>
</font><font size=1 face="}"><br>
vtkPoly->SetPoints(points); // vtkPoints * (xyz data)</font><font size=3>
</font><font size=1 face="}"><br>
vtkPoly->SetVerts(conn); // vtkCellArray * <br>
vtkPoly->GetPointData()->SetScalars(colors); // vtkUnsignedCharArray
* (rgb data)</font><font size=3> <br>
</font><font size=2 face="sans-serif"><br>
)</font><font size=3> <br>
</font><font size=2 face="sans-serif"><br>
Do you need more explanations?</font><font size=3> </font>
<br>
<br><font size=3>Please keep the discussion on the mailing list.</font>
<br>
<br><font size=3>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>
<br>
David</font>
<br><font size=2 face="sans-serif"><br>
<br>
<br>
<br>
IMPORTANT - CONFIDENTIALITY NOTICE - This e-mail is intended only for the
use of the addressee/s above. It may contain information which is
privileged, confidential or otherwise protected from disclosure under applicable
laws. If the reader of this transmission is not the intended recipient,
you are hereby notified that any dissemination, printing, distribution,
copying, disclosure or the taking of any action in reliance on the contents
of this information is strictly prohibited. If you have received
this transmission in error, please immediately notify us by reply e-mail
or using the address below and delete the message and any attachments from
your system. <br>
<br>
Amadeus Services Ltd, World Business Centre 3, 1208 Newall Road, Hounslow,
Middlesex, TW6 2TA, Registered number 4040059</font>