清空筛选条件
清空筛选条件

Closest value of huge data, Avoiding excessive iterations

2 次查看（过去 30 天）
czeslaw
czeslaw 2018-6-14
回答： KSSV 2018-6-14
Hi all,
I have the location of red dots (1000 points) and black dots (4000 points). The red dots have values associated with them.
What I want is for each black dot, find the one closest red dot and get that associated value. So the result would be a matrix of 4000x4, where 4000 is the number of black dots:
Result=[
1 x y AssociatedRedDotValue1
2 x y AssociatedRedDotValue2
3 x y AssociatedRedDotValue3
.
.
.
4000 x y AssociatedRedDotValue4000
]
If I use nested for loop, that would be 4000000 iterations, and will crash my computer. Is there much efficient way to do this?
Thanks in advance.

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

采纳的回答

KSSV
KSSV 2018-6-14
Read about knnsearch. This will give you the required number of nearest points for a given point out of the data. This is very fast and effective.

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Logical 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by