there are lines, let’s say 10 pieces, which converge to one point.
the angles between them are completely different, arbitrary/random.
it is necessary for each line to find a pair in the form of the nearest line according to the minimum angle?
I tried to solve this problem through the sphere at the point of convergence of the lines. But I think this is not entirely correct. The definition is given below.
I can ask another question if I want to do a search in groups of lines that lie in groups on different layers.
and c within each group find pairs of nearest lines?
each group of lines on its own branch of the data tree, as shown below.
if you check the pairs of the nearest ones using the loft, then he found pairs from different groups of lines.