Hi guys,
Is there a method to count how many naked edges breps have and then sort a list of breps from most naked edges to least? any help would be greatly appreciated. Thanks in advance
Best,
K
Count and sort naked edges.gh (639.7 KB)
Hi guys,
Is there a method to count how many naked edges breps have and then sort a list of breps from most naked edges to least? any help would be greatly appreciated. Thanks in advance
Best,
K
Count and sort naked edges.gh (639.7 KB)
Sure, you just need to join the naked edges and sort the breps by the amount of naked edges each brep has. Something like this:
Count and sort naked edges_RE.gh (642.6 KB)if you want to go from most edges to least just right click the “Values A” output and Reverse it
That’s great jay that will.work perfectly. Thanks so much for taking the time to help me out with this. Have a great weekend.
Best,
K