Minimum distance between two Irregular forms

9 次查看（过去 30 天）

显示更早的评论

mohammed alany 2019-3-31

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/453557-minimum-distance-between-two-irregular-forms

评论： mohammed alany 2019-4-1

采纳的回答： Image Analyst

WHAT is the min distance between these two shapes?

note: i know the connecting points of big figure.

采纳的回答

Image Analyst 2019-3-31

1
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/453557-minimum-distance-between-two-irregular-forms#answer_368325

编辑：Image Analyst 2019-4-1

在 MATLAB Online 中打开

If you have the stats toolbox, try this:

distances = pdist2(xyShape1, xyShape2)
minDistance = min(distances(:))
[minRows, minColumns] = find(distances == minDistance)

Note that pdist2 would most typically be used for the case where you have the coordinates of each of the vertices, and you want to find the two vertices that are closest to each other. That would not be the same as the two closest points: notice for example that the upper left corner of the rectangle is closer to an edge than to a vertex.

pdist2() can also be successfully used if you have the coordinates of every pixel in the objects, in which case it will return distances between pixels, which might not be exactly the same as theoretical distance that might apply for functions that the pixelated versions approximate. For one thing, pdist2 is happy to say that adjacent pixels are either distance 1 or sqrt(2) from each other rather than say that the "distance" between them is 0, because pdist2 would be looking at distances between pixel centers.

If what you have is coordinates of the vertices but you want to know distance to closest approach implied as if there are lines connecting vertices, then there are multiple approaches. One of the approaches is to use something like poly2mask() to render a polygon into pixels, after which you can use the pdist2() approach. There are also more mathematical approaches.

Walter Roberson 2019-4-1

在 MATLAB Online 中打开

[minDistance, minColumns] = min(distances);

minColumns is already a vector.

Note: you might need min(distances,2) depending on whether you need the minimum distance from each point in the first to any point in the second, or the minimum distance from each point in the second to any point in the first.

When you do a single min() call and the try to use find(), then that could be appropriate for the case where one point might happen to be exactly the same minimum distance to two more or points in the other shape, and you need to know all of them. In a situation such as that, you would generally get a different number of minimum points for each, which is a bit tricky to represent in a rectangular numeric matrix. Is this the situation that applies for you, that you need to know all of the points that are the same minimum distance? If so then typically a loop would be easiest.

mohammed alany 2019-4-1