Hello,
Does anyone have implemented any algorithm in B4J, to find the distinct closest points to another list of points?
Below is what exactly I mean:
I have for example the following sets of coordinates (the points may not valid):
Set A:
01 23.232110 37.965889
02 23.232110 37.965889
03 23.782098 38.093367
04 23.890321 37.928922
05 23.793487 37.846553
Set B:
01 23.998333 37.892229
02 23.876990 37.843657
03 23.987098 38.004005
04 23.848556 37.990321
05 23.878443 37.761990
06 23.764223 37.964473
07 23.876337 37.987654
08 23.908765 38.123456
09 23.999888 37.888999
10 23.993777 37.745336
I want to get the two distinct closest points from Set B to all points of Set A.
By distinct, I mean:
If you look at the first 2 points of Set A, they are identical.
I want to find 4 different points of Set B, for example 05,09 for 01 and 03,08 for 02.
And of course the 2 closest points for all the other points.
Thank you in advance.
Does anyone have implemented any algorithm in B4J, to find the distinct closest points to another list of points?
Below is what exactly I mean:
I have for example the following sets of coordinates (the points may not valid):
Set A:
01 23.232110 37.965889
02 23.232110 37.965889
03 23.782098 38.093367
04 23.890321 37.928922
05 23.793487 37.846553
Set B:
01 23.998333 37.892229
02 23.876990 37.843657
03 23.987098 38.004005
04 23.848556 37.990321
05 23.878443 37.761990
06 23.764223 37.964473
07 23.876337 37.987654
08 23.908765 38.123456
09 23.999888 37.888999
10 23.993777 37.745336
I want to get the two distinct closest points from Set B to all points of Set A.
By distinct, I mean:
If you look at the first 2 points of Set A, they are identical.
I want to find 4 different points of Set B, for example 05,09 for 01 and 03,08 for 02.
And of course the 2 closest points for all the other points.
Thank you in advance.