Hi amazing community!
I wanted to know if you could help me figure out how to optimize the Region Union in the attached files.
I wonder if there’s any way to just apply the Region Union to intersecting circles in the dot pattern (and thus avoiding unnecessary calculations) and speeding up the process.
I’m all ears to make it more efficient (takes circa 45 seconds). Feel free to reach out if files aren’t working.
Thanks in advance.
Ignacio,
this is just to filter the intersecting circles, like “if the sum of the radiuses is bigger than the center-to-center distance, than they intersect”, takes the total time from 28 seconds to 8 on my machine… but it doesn’t look like a final solution
001_Re.gh (25.1 KB)
by the way, you could replace the whole group with MCX which sort of does the same thing but a bit slower:
Thanks Inno!
Definitely, it sounds reasonable, so it should work like a charm. It was my intention to limit the region to just the intersecting dots, but couldn’t think about a simple way to accomplish that.
That’s why it’s great to have such a supporting community!
Have a great day!
Ignacio,
By the way Inno…
How would you use the MCX node to replace your solution? I’m scratching my head about its output.
I’m still a rookie when it comes to GH, so I wouldn’t know how to connect your MCX proposal to the Region Union.
Thanks, and apologies for being such and ignorant (but willing to learn by doing)!
Ignacio,
Thanks Inno!
Definitely, it sounds reasonable, so it should work like a charm. It was my intention to limit the region to just the intersecting dots, but couldn’t think about a simple way to accomplish that.
That’s why it’s great to have such a supporting community!
Have a great day!
Ignacio,
Awesome, thanks!
I definitely need to work more on knowing the nodes. Lists and sets aren’t the first thing that crossed my mind.
Have a great day!
Ignacio,
