Hello Hello
Sorry for bothering you with such a silly question!
Here I am faced with the problem of solid union (I suppose there is no way to union 2 exactly identical shapes if there is a way, then share it please). Therefore, to solve this problem, I use a filter to remove similar items from the list data. But I think it’s a bit wasteful to solve this problem in this way.
Is there any way to optimize this solution??
SolidUnion (QnA).gh (24.8 KB)