solid operations_q2. Group of intersecting objects

Replies to This Discussion

Permalink Reply by David Rutten on January 22, 2010 at 9:08am

This is a very difficult problem. I doubt you'll be able to solve it without some extensive VB/C# scripting.

At least it's simple to determine whether or not two spheres intersect, if the distance between the center points is more than the sum of the two radii, then both spheres intersect.

However, I suspect you only mentioned spheres to provide an example, so you'll still need to perform intersection test...

--
David Rutten
david@mcneel.com
Poprad, Slovakia

Permalink Reply by Pep Tornabell on January 22, 2010 at 9:22am

Thanks David

I will do what I need directly from rhino or micros. I present the master final thesis project in a week, fully designed, concived and modeled (not tested yet, Daniel was not fast enough, I'm jocking Daniel, delightfull work yours!) with GH.

I'll be more than glad to post the results as soon as this frenetic time frezees the 2nd of february.

:)

Permalink Reply by David Rutten on January 22, 2010 at 12:20pm

I seem to be getting somewhere with this, but the algorithm still depends on the order in which objects are supplied. I'll fiddle some more, then post the definition.

--
David Rutten
david@mcneel.com
Poprad, Slovakia

Permalink Reply by David Rutten on January 22, 2010 at 12:59pm

I think it's working now. Not the easiest thing I ever did...
There might well be cases in which it fails to find clusters of objects, I only tested on < 5 distributions.

--
David Rutten
david@mcneel.com
Poprad, Slovakia

Attachments:

• Intersection_Groups2.ghx, 95 KB

Permalink Reply by Pep Tornabell on January 22, 2010 at 6:38pm

Really cool David, many Thanks!

I will play with it! But I think I will not start exploting its capacities in one week or two.

Thank you so much