Boolean union operation of groups containing hundreds of thousands of elements.

[GiulioBj]

I'm using CadQuery to perform a boolean operation on hundreds of thousands of small parallelepipeds, but the process is extremely slow. How can I speed it up as much as possible?

[adam-urbanczyk]

I don't think you can do a lot, probably you need to use a different (i.e. CSG) kernel. Are you using cq.occ_impl.shapes.fuse?

[GiulioBj]

I don't have that advanced level of programming to understand this thing. I assume yes if it is the kernel used by cadquery.

[adam-urbanczyk]

OK, could you share the code that you are using?