Select between

Replies to This Discussion

Permalink Reply by nikos tzar on July 23, 2014 at 4:45pm

I believe this does it:

instead of the cross reference component, just graft one of the 2 inputs.

this way you have multiple lists inside a tree and each list has the distances from one face to all the others.

In order to find the minimum distance in each list, sort them and select item 1 (item 0 will always be 0 because it is the distance from each face to itself).

Now you have for every face the distance to the closest face.

flatten the output so that the data structure matches the one of the faces.

find the distances that are larger than a number and cull the rest.

Permalink Reply by User on July 26, 2014 at 4:39am

Uhm, actually I tried to use your function, but it's not working...:(

Permalink Reply by nikos tzar on July 26, 2014 at 6:07am

it worked with a brep I created.

could you post your definition so I can check it there?

(do you have multiple breps or just one?)