Hello Guys
I know that the forum raised the issue of radial sorting. But disregarding the position of the first object in the sorted list.
in the file example, there are 2 lists of points that do not lie in the same plane. it is necessary to sort the points so that the first point in the list is always closest to the positive direction of the vector x, and all the rest are clockwise relative to this one. I have a definition for radial sorting, but it does not quite correctly.
radial sort clock and vector.gh (10.2 KB)