here have 2 sets of lines, group a and group B,
I want to find the line that intersects the B group from the a group line. When it does not intersect, I will find the nearest line (need to exclude the lines that have already intersected).
When the number of lines is relatively large, the conventional method of looping will be very slow. I want to use the rtree method, does anyone who can tell me how to write the code.
test1.3dm (94.5 KB)
test1.gh (11.5 KB)