I am using General Fuse Algorithm to prepare CAD data for my Electromagnetic Simulator EmCAD (see hierarchical-electromagnetics.com).
I have the need to split a set of shapes with a second set of shapes (faces).
Each set of shapes in already intersected so that the only possible new intersections may occur between a shape of set 1 and a shape of set 2.
The number of shapes in set 1 is much graeter than the number of shapes in set 2 so that a strong improvement in the computational time (which sometime is very long) could be achieved by disabling the search of intersections between shapes of set 1.
Should it be possible to add a grouping mechanism for the arguments of the BOPAlgo_Builder so that the search for interference is restricted to couple of shapes belonging different groups ?