By the way, I solved this problem by creating the set of interpolated curves (with offending segments), exploding them, using a function to compare the length of each segment against the length of the smallest segment, and then culling the offending segments (which are always much longer than the proper point to point connections). Processor intensive, me thinks, but it works. FYI.
Marc On May 3, 1:31 pm, Marc Syp <marc....@gmail.com> wrote: > http://groups.google.com/group/grasshopper3d/web/crossGrid.ghxhttp://groups.google.com/group/grasshopper3d/web/CrossGrid.3dm > > I am using a point grid from a surface for a part of a larger project, > and I need to reorder this grid of points to also get all of the lines > that connect on a diagonal. I have tried a handful of different > sorting algorithms using List shifting, number series, etc. Anyway, > this is the closest I can get. Unfortunately, I get the diagonal > points in groups of 30 (or sometimes 29) but they need to be broken up > further so I can separate the cross bars from each other. As of now I > have to bake, explode, delete offending segments, rejoin, and then go > from there. I would like to be able to separate into proper paths and > use Interpolate Points Crv on this without baking and adjusting > first. I started mapping the values to see if I could get a number > series Subset logic going, but this one has got me stumped because > some paths need to be broken into 2 pieces and others into 3. > > Please take a look. Any ideas? Maybe this is completely the wrong > approach? I tried a couple other approaches but didn't even get this > far. I feel like I'm missing something simple. > > Thanks, > Marc
