Fast 2D distance calculation
32 views (last 30 days)
Many of the codes I am currently using depend on a simple calculation: the distance between a single point and a set of other points.
In one example, using the matlab profiler I see that this single calculation takes 50% of the total function time, so I would like to optimise it as far as possible.
I have looked around and haven't found anything more optimal than:
p1 = rand(1,2); % single point
pn = rand(1000000,2); % random points
d = sqrt(sum((p1-pn).^2,2)); % calculate the distance between these
Does anyone else have a clever idea that would optimise this - even just by a tiny fraction? Is there any way to speed these calculations up on the GPU or using a mex? I would be really happy to see any suggestions.
I suspect this might be already be as mathematically simple as possible, but I'm frustrated because I need to calculate this a lot.
I have already vectrorised my code as far as possible.
Thanks for any help,
Matt J on 29 Jul 2019
Edited: Matt J on 29 Jul 2019
If you have the Parallel Computing Toolbox, you can execute the computations on the GPU just by building p1 and pn as gpuArrays. That should definitely speed things up.
p1 = gpuArray.rand(1,2);
pn = gpuArray.rand(1000000,2);
d = sqrt(sum((p1-pn).^2,2));
toc %Elapsed time is 0.001429 seconds.