Hello Everyone, I want to compute the distance (SqEuclidean) of a new point (newP) from the existing neighboring points in a specific order. I have the following code: newP=[x y z] for i in eachindex(order) Dist[i]=sum((Points[order[i], :]' - newP) .^ 2) end However, the above piece of code comp…

Some ways to do this are: pairwise2(x::AbstractMatrix, y::AbstractMatrix) = sum(abs2, x; dims=1)' .+ sum(abs2, y; dims=1) .- 2 .* (x'*y) # written to use columns Dist ≈ pairwise2(Points[order, :]', newP') using Distances Dist ≈ pairwise(SqEuclidean(), Points[order, :], newP; dims=1) # dims=1 mea…

Alternative to computation in a loop for distances for fast performance

General Usage Performance

jlapeyre December 6, 2021, 1:20pm 3

Topic		Replies	Views
Faster squared euclidean distance calculation Performance	11	1916	October 2, 2021
Compute pairwise distances (Distances.jl) General Usage performance , distances , tullio , loopvectorization	9	3834	February 1, 2024
Getting the benchmarked speedup from Distances.jl General Usage performance	8	585	September 7, 2020
How to make LoopVectorization work with computing Euclidean distance for every column? New to Julia tullio , loopvectorization	13	1176	August 21, 2020
Euclidean distance from one point Performance question	6	1254	June 17, 2020

Alternative to computation in a loop for distances for fast performance

Related topics