Hi Albu, I think so, yes. Your problem is that you have many points and only a few curves, and you need to project the points to only very specific curves, correct?
In order to achieve this, you have to make sure that the [Curve CP] component is given a matched set of points and curves. You can use the DuplicateData component for this. see: http://groups.google.com/group/grasshopper3d/web/ProjectToNextCurve.jpg 1) divide a bunch of curves with 10 points each 2) shift the curve list (shift=+1, wrap=no) 3) duplicate the shifted list N+1 times, where N is the number of division segments. If your curves are closed, there is no need for the "N+1" expression. 4) Now call Curve CP and use a shortest list option 5) Finally make lines (again, using shortest list) between the original division points and the projected points. -- David Rutten Robert McNeel & Associates On Oct 29, 4:04 pm, albu <[EMAIL PROTECTED]> wrote: > Yes, but I'm not dividing one single curve and getting it out from > itself . > > I have several ones, witch I'm dividing. > When i apply the Curve CP (out of these division points and lines), i > get every closest point from every curve, applied to all of the curves > (with the cross reference). > With the Longest List, i get all the closest points from all curves, > but just in relation to the first curve. > > What i wanted was to get the closest points from the curves, but only > applied into every second curve, having just one closest point > corresponding to a division point... > > From points of curve A get the closest points in curve B; the ones > from curve B in curve C, and so on... > > Is it more clear...? > > David Rutten wrote: > > Hi albu, > > > I don't follow, if the points are the result of a curve division, > > isn't the shortest distance always zero? > > > -- > > David Rutten > > Robert McNeel & Associates > > > On Oct 29, 3:30 pm, albu <[EMAIL PROTECTED]> wrote: > > > Hi. > > > I have a range of curves, similar to topographical ones (defined in > > > grasshopper), with different lengths. I divided them with a Divide > > > Length, obtaining different number of points in each curve. > > > I want to get the shortest distance from each of the points to the > > > closest curve in the range. > > > I'm applying this in order to be able to apply a box to each point, > > > and scale the box according to the distance till the next curve. > > > > The Curve CP is retrieving a the closest point, not to the closest > > > curve, but to all of them. > > > I've tried to list the curves, etc, but I'm haven't able to get there > > > so far... > > > Can anyone help me? > > > thanks
