Ordering the closest points to a certain point
1 次查看(过去 30 天)
显示 更早的评论
I have a randomly generated set of k points on a graph. I'm trying to order each points distance in reference to the other. Each point is labelled 1 to n with no particular order. I want each of the n points to create a list that has the x and y coordinates of the other points all in increasing order of distance. Here's what I tried so far but it's not working for me.
for n=1:k
x(1,n) = 50.*rand(1,1)+25;
y(1,n) = 50.*rand(1,1)+25;
end
for n=1:k;
for i=1:k;
if n~=i
d(n,i)= sqrt(((x(1,i)-x(1,n))^2)+(y(1,i)-y(1,n))^2);
else
d(n,i)=NaN
end
end
sort(d(n,:));
end
for n=1:k;
for i=1:k;
for j=1:k;
if (sqrt(((x(1,i)-x(1,n))^2)+(y(1,i)-y(1,n))^2)) == d(n,j)
x(n,j)=x(1,i);
y(n,j)=y(1,i);
end
end
end
end
So the idea is that x(n,1) would be the x coordinate of the closest point to the nth point.
0 个评论
采纳的回答
Walter Roberson
2011-6-27
Sounds like a nearest-neighbour computation.
x = 50.*rand(1,k)+25;
y = 50.*rand(1,k)+25;
dists = cell2mat(arrayfun(@(K) bsxfun(@(J,K) hypot(x(J)-x(K),y(J)-y(K)), K, 1:k), 1:k, 'Uniform',0).');
[sorteddists, rowidx] = sort(dists,2);
This does need some enhancement, though: before doing the sort, you should remove the diagonal, as points are always distance 0 from themselves. You could sort and then remove the first column, but there is a danger in doing so: if any of the points are in exactly the same place, then because the sort is "stable", there will be a row in which the point that is in the same place sorts before the point to itself. Replacing the diagonal with -inf before doing the sort would probably work.
3 个评论
更多回答(0 个)
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Creating and Concatenating Matrices 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!