partitioning list according to distances

Replies to This Discussion

Permalink Reply by Joseph Oster on June 3, 2017 at 2:27pm

What part of this are you writing yourself?

8 curves into 5 branches [...] the first branch will have 2 curves, the next one will have 3 and so on...

"and so on" with only eight curves total?  That series would be 2,3, 4... oops!  That's nine curves in only three branches.  I can't see any point in looking at the code when the description sounds doomed to fail.

Permalink Reply by ines on June 3, 2017 at 2:58pm

Hey! Thanks for your answer!

Sorry if I wasn't clear enough.. I wrote it all by myself

I need the length of each list to be different, according to the closeness to the other list..

So I need the first branch to have 2 curves, the second branch to have 3, the third branch to have 2 curves the fourth one will have none, and the last one will have one.

Like the closest point component but with curves (?)

Does that make any sense? 

Permalink Reply by Michael Pryor on June 3, 2017 at 5:53pm

Well you will need to define what does "closness" mean for a curve. Does it simply mean a part of the curve is close or that the center of the curve is close? or some kind of average. If you can define test points you can use this. 

http://formularch.blogspot.com/2012/04/gh-distance-grouping.html

there is also a point groups component

Permalink Reply by ines on June 4, 2017 at 4:51am

That was very helpful, thanks