Boolean / Shape intersections

 

Good evening, 

 

Could you please help me with a boolean substraction-ish operation of the type A(1 object) - B(7100 objects). 

I have tried it through different workflows, many many times, and each time it proved inefficient and generally torturous. Has anyone tried something like this before? Is it really that exceptional? How can I speed up booleans? I tried different approaches like split, trim, etc... it just takes too long, i think it's +1h for ~1300 objects. The objects are simple boxes. 

 

Thanks, even you're just passing through.

  • up

    Andrew Heumann

    hmmm... can you give us more information about the geometry you're working with? I don't know if this makes matters better or worse from a standpoint of speed, but I have had success in the past trying to boolean sequentially (via scripting) instead of all at once: A minus B0, result minus B1, new result minus B2, etc.
    5