Finding Intersection of Multiple Breps

[diff-arch]

Hi @ccheng11,

You can refer to my post in a previous thread, where the user had a very similar problem to solve.

Python: Solid intersection multiple

It’s kinda difficult to achieve, since you would need complex functions (probably recursive ones) and an expanded knowledge of how booleans work, as well as flawless input geometry, for it to work. Your basic script logic is right, but it’s missing a lot of stuff! For instance, in your loop, if i equals j, you are trying to intersect the same brep with itself, which would probably not be desirable. You could prevent this by simply calling if i != j: before trying to intersect. You could als…

Furthermore, try to provide a clearer explanation of your problem!
“To find the intersection between multiple breps” could already describe a lot of things. Do you only want to know, which breps are intersecting, or are you after intersection geometry. If so, do you want intersection curves and points, or intersection breps.

Also, for the love of “god”, try to provide a file! It would probably have better shown, what you’re really after.