Find close points in two matrices of coordinates

Question

Adam Fitchett 2022-9-22

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1810140-find-close-points-in-two-matrices-of-coordinates

评论： Adam Fitchett 2022-9-28

I have two different length matrices of 3D coordinates. I want to find all the unique coordinates in one matrix that are within a certain Euclidean distance of any of the coordinates in the other matrix. What is the most efficient way to do this?

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Torsten 2022-9-22

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1810140-find-close-points-in-two-matrices-of-coordinates#answer_1058775

编辑：Torsten 2022-9-22

Use "pdist2" to calculate the distances of the sites of the first set to the sites of the second set.

Check which rows of the distance matrix D have an entry <= dmax where dmax is your prescribed maximum distance.

These are the sites of the first set you want to determine.

3 个评论
显示 1更早的评论隐藏 1更早的评论

Torsten 2022-9-22

编辑：Torsten 2022-9-22

在 MATLAB Online 中打开

Works for me.

set1 = [0,1,4;
       2 5 8];
set2 = [-1,3,6 ;...
        4,2,7 ;...
        -2 6 9];
dmax = 3;
distance_set1_set2 = pdist2(set1,set2)
distance_set1_set2 = 2×3
    3.0000    5.0990    7.3485
    4.1231    3.7417    4.2426
indices = any(distance_set1_set2 <= dmax,2)
indices = 2×1 logical array
   1
   0
set1(indices==1,:)
ans = 1×3
     0     1     4