Re: Boolean union problem with large batches

Actually I had a pretty simple idea on how to tune up boolean union to help avoid this problem, it looks like it should solve it pretty well. I just sort the group of objects by bounding box diagonal size so that the largest one gets processed first. That will tend to make combinations that intersect each other and avoid the problem area that happens when trying to combine many non-intersecting pieces first during part of the Union calculation.

It looks pretty promising so far, looks like it could solve most of those group boolean union issues even before real bug in there is fixed up.

So there should be an improvement to this batch boolean union processing for the next beta.

- Michael