Hello, How do I sort points across multiple curves. the points must add up from left to right.
In the current situation the points are random. in some cases it goes from 1 to 0 instead of 0 to 1.
Please internalise data and upload your .gh file
Mc neel forum.gh (35.0 KB)
This is the file!
Sorry, we need a bit more context than that ![]()
Whatever is generating these points is responsible for their ordering in the output lists:
Hello Tom, is this enough?
More info.gh (56.5 KB)
Ultimately, the issue is the remove duplicate pts component, which doesn’t have predictable behaviour.
I feel like there’s a much simpler way of getting the points you’re after, without having to intersect surfaces and curves, but this little snippet is still much too isolated. Without understanding the logic behind your goal, I can’t figure out an alternative solution.
What do you have to know?
I just don’t understand the meaning of your geometry. It’s too abstract.
What is the actual physical reality that you are approximating with a computer model?
Why are these breps being intersected with these lines?
What are the inputs?
What is the expected output?
Something like “I have these buildings, defined by this geometry. Under these conditions, I want to create these features, with these dimensions. To do this, I have used this logical sequence of operations.”
None of that can really be decyphered from very isolated bits of code.

