Solving geometric problem using K2 collision goals

[Sepideh_Garivani]

Hello

I’m trying to use Kangaroo to solve a geometric problem which seems quite difficult to me to achieve through a mathematical approach.

I’d like to find the smallest polyhedron while keeping all four corners on the given set of lines and which doesn’t collide with the sphere (which represents the space needed for a connection piece)

Does anyone has any idea how to do this? Any help is much appreciated!

Minimum polyhedron container.3dm (371.9 KB)

[martinsiegrist]

I assume the joints aren’t at regular angles (120°)?

[Sepideh_Garivani]

No, unfortunately all the angles are different and there are 84 unique nodes. Do you mind to upload the script for this?
Thank you so much

[martinsiegrist]

I didn’t create a script. I modeled this by hand to better understand the question.