recursive union in C#

Hi Guys,

I am writing a script to create a recursive boolean function in c# and I reached a good level where all the intersected geometries get unioned. Some times there is a brep that doesn't intersect and that breaks the loop before it starts. Now I am looking for a method does something similar to this :

List<Brep> unionedParts = ...;

List<Brep> Leftovers = ...;

double Tolerance = 0.1;

if (Brep[] Brep.CreateBooleanUnion(unionedParts, Tolerance))

{

___Continue the operation___

}

else

{

Leftovers.AddRange(unionedParts);

};

Can anyone tell me how to do it pleas?

I am in a rush .....

Replies to This Discussion

Permalink Reply by ghaith Tish on June 15, 2016 at 4:19am

Thanks for the assistance. I am always learning from your style of scripting.

Permalink Reply by peter fotiadis on June 15, 2016 at 4:40am

Forgot to mention that IF you don't ride a (*) Ducati (**) within 6 days the DucatiUderAlles virus would destroy (***) your computer (and you).

(*) a Panigale, what else?

(**) properly

(***) no mercy!

Permalink Reply by Thomas R Williams on March 22, 2019 at 3:40pm

Your script is awesome! Exactly what I needed. Really well done. Gotta admit I was a lil afraid to download because you speak like you have a virus in your amygdala. I guess if you let your shadow hang all the way out, it can really do some heavy lifting.

Permalink Reply by ghaith Tish on June 14, 2016 at 5:09am

The problem is that the method breaks when the boolean doesn't occure. It doesn't output a boolean value or continue to the other breps

Permalink Reply by Daniel González Abalde on June 14, 2016 at 5:37am

I'll bet you are accessing an empty list, the error message is index out of range? If so, simply checks if the array has some brep element.

Permalink Reply by ghaith Tish on June 14, 2016 at 6:18am

No, it is not an empty list it is just that the intersection event Brep.Brep boolean gives me always a True value even if the two Breps never intersect. Any ideas ?

Permalink Reply by ghaith Tish on June 14, 2016 at 6:23am

Curve[] lstCrvs ;
    Point3d[] lstPts ;

    bool N = Rhino.Geometry.Intersect.Intersection.BrepBrep(x, y, 0.01, out lstCrvs, out lstPts);
    A = N;
    B = lstCrvs;

Permalink Reply by Daniel González Abalde on June 14, 2016 at 8:52am

brep.CreateBooleanUnion() return an array of brep, if this array is empty, then you know that has not occurred an union, if you have an item has gone successfully, and if you have two or more, then they would not have joined. So, check that array and if .count <> 1 then continue for.

Permalink Reply by ghaith Tish on June 14, 2016 at 7:37pm

Thanks for the answer. The boolean crashes the script before the value stored. What I am looking for is a good exit procedure before the union crashes the script.

Permalink Reply by ghaith Tish on June 15, 2016 at 4:24am

Thanks. I have no idea of what are you are talking about. but worth to be investigated !. I think it is the same as limiting the number of iterating the union. the concept was to control where the boolean begins when I face such case where there are list of objects to union.

Permalink Reply by ghaith Tish on June 14, 2016 at 5:16am

Probably it has to do with the intersection events.