Hi Joao, this will be very difficult because it's hard to say how many points were generated on each curve. When you divide a curve, you can work out from its length how many points there must be, but in this case, you're in trouble.
I doubt this is do-able without data-hierarchies. -- David Rutten Robert McNeel & Associates On Nov 3, 1:57 am, albu <[EMAIL PROTECTED]> wrote: > Hi again. > > I'm back with a slight different version of my last doubt. > I want to get the same as i did the last time, in every second curve, > to extract the closest points to the division points in every first > curve. > The difference this time, is that I'm not dividing the 1st curves, but > the points that I'm getting in the curves are the intersection between > a plane and the curves. > > http://grasshopper3d.googlegroups.com/web/Closestdistancefrompointtor... > > What i'm getting are the closest points, but always into one single > curve...and i wanted, as in the last time, them projected into every > second curve... > > I don't get it, is it the type of list that i get from the > intersection points that is different than the one that i was getting > when i was dividing the curves on the previous example? > > thanks
