hi everybody,
I tried to create an solution to find the minimum bounding boxes for multiple breps. The trick is that they all have their individual rotation.
I can use the galapagos solver for one brep at the time, but my hope is to make one that solves the best solution for multiple breps.
here an example of the situation. I need to find the smallest boundingbox for each part.
Use galapagos or create a certain number of rotated planes and sort by volume…
For the example i used a part of the project. In total there are much more blocks, almost 200.
I’am looking for a way to automate this
Depending on the accuracy you want, create a polar array of let’s say 36 rotated planes. This way you get 36 bounding boxes for each part and you can extract the smallest one.
I can give it an try, but in this case there will be 7200 boxes… let;s find out.
thanks
Save the definition and the Rhino file before you run the definition.
have you tried using galapagos for all the breps together and minimizing the sum of the volumes? how does it behave?
In this thread you will find custom components made for doing just that.
